Every k-edge-connected graph has a polynomially constructible spanning tree that is O(1/k)-thin for all η-near-minimum cuts with η = 1/40.
Colbourn and Wendy J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Establishes closed all-rank formulas for P_r(G) in cyclic-index groups and F_q-Heisenberg families, plus rigidity and isoclinism determination from low-rank values.
citing papers explorer
-
Thin Trees for Near Minimum Cuts
Every k-edge-connected graph has a polynomially constructible spanning tree that is O(1/k)-thin for all η-near-minimum cuts with η = 1/40.
-
Higher Commutativity in Finite Groups, Rigidity, Extremal bounds, and Heisenberg-Type Families
Establishes closed all-rank formulas for P_r(G) in cyclic-index groups and F_q-Heisenberg families, plus rigidity and isoclinism determination from low-rank values.