English

Regular spanning subgraphs of bipartite graphs of high minimum degree

Combinatorics 2007-10-13 v2

Abstract

Let G be a simple balanced bipartite graph on 2n2n vertices, δ=δ(G)/n\delta = \delta(G)/n, and ρ=δ+2δ12\rho={\delta + \sqrt{2 \delta -1} \over 2}. If δ>1/2\delta > 1/2 then it has a ρn\lfloor \rho n \rfloor-regular spanning subgraph. The statement is nearly tight.

Keywords

Cite

@article{arxiv.0708.0202,
  title  = {Regular spanning subgraphs of bipartite graphs of high minimum degree},
  author = {Béla Csaba},
  journal= {arXiv preprint arXiv:0708.0202},
  year   = {2007}
}

Comments

submitted

R2 v1 2026-06-21T09:04:01.551Z