Nash-Williams theorem

In graph theory, the Nash-Williams theorem is a tree-packing 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 ${\textstyle V_{1},\ldots ,V_{k}\subset V(G)}$ where ${\displaystyle V_{i}\neq \emptyset }$ there are at least t(k − 1) crossing edges (Tutte 1961, Nash-Williams 1961).^[1][2]

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.)