A short proof of the tree-packing theorem
Abstract
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.