arXiv:0911.2809 Abstract | arXiv Analytics

Published 2009-11-14, updated 2012-03-06Version 3

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

DOI: 10.1016/j.disc.2012.01.020

Categories: math.CO

Subjects: 05C40

Keywords: short proof, tree-packing theorem, short elementary proof, edge-disjoint spanning trees

Tags: journal article

Related articles: Most relevant | Search more

arXiv:1605.04000 [math.CO] (Published 2016-05-12)

A short proof that NMF is NP-hard

Yaroslav Shitov

arXiv:1012.5710 [math.CO] (Published 2010-12-28)

The generalized connectivity of complete bipartite graphs

arXiv:1610.04581 [math.CO] (Published 2016-10-14)

Nowhere-zero $3$-flow and $\mathbb{Z}_3$-connectedness in Graphs with Four Edge-disjoint Spanning Trees