Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — GGG has kkk edge-disjoint spanning trees iff ∣EP(G)∣≥k(∣P∣−1)|E_P(G)| \ge k(|P|-1)∣EP​(G)∣≥k(∣P∣−1) for every partition PPP

Proved
NashWilliams61.TreePacking.theorem_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1partitionspanning-treetree-packing

Let GGG be a finite unoriented multigraph without loops (parallel edges allowed) on a non-empty vertex set VVV, and let kkk be a positive integer. For a partition PPP of VVV let EP(G)E_P(G)EP​(G) be the set of edges whose ends lie in different members of PPP. Then GGG has kkk pairwise edge-disjoint spanning trees if and only if

∣EP(G)∣≥k (∣P∣−1)for every partition P of V.(1)|E_P(G)| \ge k\,(|P| - 1) \qquad \text{for every partition } P \text{ of } V. \tag{1}∣EP​(G)∣≥k(∣P∣−1)for every partition P of V.(1)

This is the tree-packing theorem, proved independently by Tutte (1961) and Nash-Williams (1961). It characterises the maximum number of edge-disjoint spanning trees by a min-max formula over vertex partitions and underlies the theory of matroid base packing.

Formalization Note VVV is assumed non-empty (the paper's graphs have a vertex; on an empty vertex set no tree exists while (1) holds). The kkk trees are a family indexed by {1,…,k}\{1, \dots, k\}{1,…,k} with pairwise disjoint edge sets, each a spanning tree of GGG in the multigraph sense. The inequality (1) is in Z\mathbb ZZ and is required for every partition, including the one-part partition and the partition into singletons.

Preamble
import Mathlib
import Definitions.Def_NagamochiIbaraki_EdgeConn_Multigraph
import Definitions.Def_NashWilliams61_TreePacking_Graphs
open NagamochiIbaraki.EdgeConn
Formal statement
namespace NashWilliams61.TreePacking

/-- **Theorem 1** (Nash-Williams 1961, p. 445). A finite loopless multigraph `G` on a
non-empty vertex set has `k` edge-disjoint spanning trees if and only if
`|E_P(G)| ≥ k(|P| − 1)` for every partition `P` of `V(G)`. -/
theorem theorem_1 {V E : Type} [Fintype V] [DecidableEq V] [Nonempty V] [Fintype E]
    [DecidableEq E] (ends : E → Sym2 V) (hloop : ∀ e, ¬ (ends e).IsDiag) (k : ℕ) (hk : 0 < k) :
    (∃ T : Fin k → Finset E, (∀ i j, i ≠ j → Disjoint (T i) (T j)) ∧
        ∀ i, IsSpanningTree ends (T i)) ↔
      ∀ P : Finpartition (Finset.univ : Finset V),
        (k : ℤ) * ((P.parts.card : ℤ) - 1) ≤ ((crossing ends P).card : ℤ) := by sorry

end NashWilliams61.TreePacking
Source
Nash-Williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), p. 445, Theorem 1, Eq. (1)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me