Spanning tree packing and 2-essential edge-connectivity (Q2092353)

This paper studies spanning tree packing and 2-essential edge-connectivity. Let \(k+1\le m\le 2k-1\). Suppose \(G\) is an \(m\)-edge-connected 2-essentially \(h\)-edge-connected graph that is not a \(K_5\) or a fat-triangle with multiplicity at most \(k-1\). Define \(f(m,k)=2m+k-4+\frac{k(2k-1)}{2m-2k-1}\) if \(m<k+\frac{1+\sqrt{1+8k}}{4}\), and \(f(m,k)=m+3k-4+\frac{k^2}{m-k}\) otherwise. If \(h\ge f(m,k)\) then \(G\) is shown to have \(k\) edge-disjoint spanning trees. Moreover, every 3-edge-connected essentially 5-edge-connected and 2-essentially 8-edge-connected graph has two edge-disjoint spanning trees.