Family 174CombinatoricsLeanNot yet digested
Deterministic construction of strong thin spanning trees
Resolves the strong thin-tree conjecture constructively. Every finite loopless k-edge-connected multigraph on at least two vertices has a spanning tree containing at most a universal fraction of the edges of every cut. Such a tree can be found deterministically in polynomial time, even with binary-encoded parallel-edge multiplicities.
Manuscripts in this family · 2
The strong thin tree conjecture
Sep 23, 2026·paper.pdfLean
We prove that every finite loopless k-edge-connected multigraph on at least two vertices, with k ≥ 1, has a spanning tree meeting each cut in at most times the size of the cut, where C is a universal constant. This resolves the strong thin tree conjecture.
A polynomial-time construction of strong thin trees
Sep 23, 2026·paper.pdf
We give a deterministic polynomial-time construction of strong thin trees. Given a finite k-edge-connected loopless multigraph on at least one vertex, the algorithm constructs a spanning tree meeting every cut in at most a fraction of its edges, for a universal constant C. The running time is polynomial in the binary input length, including when parallel-edge multiplicities are encoded in binary.