Nash-Williams theorem
Nash-Williams theorem is a theorem in graph theory describing number of edge-disjoint spanning trees a graph can have.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 16, 2026 · revision 2398125168
- Described as
- theorem in graph theory describing number of edge-disjoint spanning trees a graph can have
- What it is
- theorem
- Named after
- Crispin Nash-Williams
- Wikipedias with a page
- 1
Wikidata item Q65066994 (wikidata.org/wiki/Q65066994), public domain (CC0). Copied 2026-11-16.
What Wikipedia says · copied November 16, 2026 · revision 1332584259
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 V1,…,Vk⊂V(G) where Vi≠∅︀ there are at least t(k − 1) crossing edges.
The theorem was proved independently by Tutte and Nash-Williams, both in 1961. In 2012, Kaiser gave a short elementary proof.
For this article, we 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.)
From the Wikipedia article “Nash-Williams theorem” (en.wikipedia.org/wiki/Nash-Williams_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
