Skip to content

Import Nash-Williams–Tutte tree packing and arboricity #669

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Vilin97 merged 4 commits into from
Oct 17, 2026
Merged

Import Nash-Williams–Tutte tree packing and arboricity #669

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
1ca3554
Import Nash-Williams–Tutte tree packing and arboricity
Vilin97 Oct 17, 2026
4ed45fa
Polish imported theorem documentation
Vilin97 Oct 17, 2026
882dec7
Disclose nonempty vertices in the tree-packing summary
Vilin97 Oct 17, 2026
e7a7cdd
Clarify Diestel citation as theorem background
Vilin97 Oct 17, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 34 additions & 0 deletions LeanPool/NashWilliamsTutte.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
/-
Copyright (c) 2026 Juan Pablo Traverso Gianini. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Pablo Traverso Gianini
-/
module

public import LeanPool.NashWilliamsTutte.Theorems

/-!
# Nash-Williams–Tutte tree packing and arboricity

Source: doi:10.1112/jlms/s1-36.1.445, url:https://github.com/jtraverso/nash-williams-trees/tree/101e48847a929dd8102521f57723e2137989ce2e
Authors: Juan Pablo Traverso Gianini
Status: verified
Main declarations: `NashWilliamsTutte.tree_packing`, `NashWilliamsTutte.arboricity`
Tags: graph-theory, tree-packing, arboricity, edge-connectivity
MSC: 05C05, 05C70, 05C40
-/

/-!
# Nash-Williams–Tutte tree packing and arboricity

Adapted from jtraverso/nash-williams-trees at
101e48847a929dd8102521f57723e2137989ce2e.
The proofs were generated by Harmonic's Aristotle from statements and a proof plan
prepared by Juan Pablo Traverso Gianini with Claude Code.

These are the finite simple-graph versions of the tree-packing theorem of
Nash-Williams (1961), doi:10.1112/jlms/s1-36.1.445, and Tutte (1961),
doi:10.1112/jlms/s1-36.1.221, and the arboricity theorem of Nash-Williams (1964),
doi:10.1112/jlms/s1-39.1.12. For background on these statements, see Diestel,
*Graph Theory*, fifth edition, Section 2.4, doi:10.1007/978-3-662-53622-3.
-/
Loading
Loading