A short proof of the tree-packing theorem
classification
🧮 math.CO
keywords
proofshortcharacterizationedge-disjointelementarygivegraphsnash-williams
read the original abstract
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.