Given a $k$-edge-connected graph $G = (V,E)$, a spanning tree $T$
is $\alpha$-thin w.r.t. $G$, if for any $S \subset V$, $|T(S,V -
S)| \leq \alpha.|E(S,V - S)|$. The thin tree conjecture asserts
that for a sufficiently large $k$ (independent of size...
Read More