Theoremadvanced
Nash-Williams-Tutte theorem
Also called tree packing theorem, Tutte-Nash-Williams theorem.
A graph has k edge-disjoint spanning trees iff every vertex partition has at least k(p-1) crossing edges.
A graph has k edge-disjoint spanning trees iff every vertex partition has at least k(p-1) crossing edges.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag X70A8S Edit this page History Report an error