Nash-Williams theorem

In graph theory, the Nash-Williams theorem is a theorem that describes how many edge-disjoint spanning trees (and more generally forests) a graph can have: A graph G has t edge-disjoint spanning trees iff for every partition where there are at least t(k − 1) crossing edges (Tutte 1961, Nash-Williams 1961). For this article, we will say that such a graph has arboricity t or is t-arboric. (The actual definition of arboricity is slightly different and applies to forests rather than trees.) rdf:langString