A short proof of Kundu's k-factor theorem

DOI10.1016/0012-365X(88)90070-2zbMath0651.05054OpenAlexW2055078215MaRDI QIDQ1106246

William Y. C. Chen

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90070-2

zbMATH Keywords

graphical sequencesgraphical degree sequencek-factor Theorem

Mathematics Subject Classification ID

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

Related Items (13)

Packing of graphic n-tuples ⋮ The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ On joint realization of (0,1) matrices ⋮ Half-regular factorizations of the complete bipartite graph ⋮ On factorable bigraphic pairs ⋮ Packing tree degree sequences ⋮ Degree sequences and the existence of \(k\)-factors ⋮ New results on degree sequences of uniform hypergraphs ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ A note on packing of graphic \(n\)-tuples ⋮ Graphic Sequences Have Realizations Containing Bisections of Large Degree ⋮ Navigating between packings of graphic sequences ⋮ Multi-switch: A tool for finding potential edge-disjoint 1-factors

Cites Work

• Parallel concepts in graph theory
• The k-factor conjecture is true
• Generalizations of the k-factor theorem
• Valencies of graphs with 1-factors
• On factorable degree sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Factors and factorizations of graphs—a survey

This page was built for publication: A short proof of Kundu's k-factor theorem