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 vertices, , and . If then it has a -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