Nash-Williams' forest cover theorem
From Egres Open
Theorem (Nash-Williams [1]). The edges set of a graph G=(V,E) can be covered by k forests if and only if [math]i_G(X) \leq k(|X|-1)[/math] for every non-empty subset X of V.
