The strong thin tree conjecture
Recorded by the registry's curators from GitHub; the authors did not submit it here.
OpenAI
We prove that every finite loopless \(k\)-edge-connected multigraph on at least two vertices, with \(k\ge1\), has a spanning tree meeting each cut in at most \(C/k\) times the size of the cut, where \(C\) is a universal constant. This resolves the strong thin tree conjecture.
Claims
SOLUTION CLAIMED
OP-00726 — Strong thin-tree conjecture
Files and sources
- Paper
- math @ 1581d4c, source/main.tex ↗
- Posted on GitHub
- 6 October 2026
No verification run is on record for this version.