The strong thin tree conjecture
There is a universal constant such that, for every integer , every finite -edge-connected undirected multigraph without loops and with at least two vertices has a spanning tree satisfying for every .
The iterative argument in Section 7 is complete and rigorous, and all supporting ingredients (Proposition 6.2 and Theorem 2.3) are fully proved in the manuscript.
“Theorem 1.1. There is a universal constant C > 0 such that, for every integer k ≥ 1, every finite k-edge-connected undirected multigraph without loops and with at least two vertices has a spanning tree T satisfying |δT (S)| ≤ C/k |δG(S)| for every ∅ ̸= S ⊊ V.” · Show in paper