Regular spanning subgraphs of bipartite graphs of high minimum degree

zbMath1157.05322arXiv0708.0202MaRDI QIDQ1010593

Béla Csaba

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.0202

zbMATH Keywords

bipartite graphbipartitionspanning subgraphfactors of graphsspanning regular subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (4)

Approximate multipartite version of the Hajnal-Szemerédi theorem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Graphic Sequences Have Realizations Containing Bisections of Large Degree ⋮ Improved queue-size scaling for input-queued switches via graph factorization

This page was built for publication: Regular spanning subgraphs of bipartite graphs of high minimum degree