A short proof of the tree-packing theorem
Tom\'a\v{s} Kaiser
TL;DR
This paper presents a concise, elementary proof of the classical theorem by Tutte and Nash-Williams that characterizes graphs capable of containing k edge-disjoint spanning trees.
Contribution
It offers a simplified and accessible proof of the tree-packing theorem, enhancing understanding and teaching of this fundamental graph theory result.
Findings
Provides a shorter, elementary proof of the tree-packing theorem
Clarifies the conditions for graphs to have k edge-disjoint spanning trees
Simplifies the original proof for broader accessibility
Abstract
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.