A short proof of the tree-packing theorem

2009/11/30 by Tomáš Kaiser · 1 citation
Mathematics · #math.CO #msc:05C40

paper · pdf · doi:10.1016/j.disc.2012.01.020

arxiv created 2012/03/06 · arxiv updated 2012/03/07

Abstract

We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.

Cited by

• Enumerating tuples of spanning trees

Related

• Packing spanning arborescences with extra large one
• On spanning tree packings of highly edge connected graphs
• Packing spanning trees and the k-tree protocol
• Packing of Rigid Spanning Subgraphs and Spanning Trees
• Packing Steiner Trees