Sciweavers

63
Voted
COMBINATORICS
2007

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree

14 years 10 months ago
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is nearly tight.
Béla Csaba
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where COMBINATORICS
Authors Béla Csaba
Comments (0)