A short proof of the tree-packing theorem
Combinatorics
2012-03-07 v3
Abstract
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
Cite
@article{arxiv.0911.2809,
title = {A short proof of the tree-packing theorem},
author = {Tomáš Kaiser},
journal= {arXiv preprint arXiv:0911.2809},
year = {2012}
}