Csaba, Béla Regular spanning subgraphs of bipartite graphs of high minimum degree. (English) Zbl 1157.05322 Electron. J. Comb. 14, No. 1, Research Paper N21, 7 p. (2007). Summary: Let \(G\) be a simple balanced bipartite graph on \(2n\) vertices, \(\delta = \delta(G)/n\), and \(\rho_0=\frac {\delta+\sqrt{2\delta-1}}{2}\). If \(\delta \geq 1/2\) then \(G\) has a \(\lfloor \rho_0 n \rfloor\)-regular spanning subgraph. The statement is nearly tight. Cited in 4 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C12 Distance in graphs Keywords:spanning subgraph; factors of graphs; bipartite graph; bipartition; spanning regular subgraph PDFBibTeX XMLCite \textit{B. Csaba}, Electron. J. Comb. 14, No. 1, Research Paper N21, 7 p. (2007; Zbl 1157.05322) Full Text: arXiv EuDML EMIS