Tight spectral radius conditions guarantee k edge-disjoint spanning trees in (k+c)-edge-connected graphs, with families of extremal graphs identified.
Tutte, On the problem of decomposing a graph intonconnected factors, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
Tight spectral radius conditions guarantee k edge-disjoint spanning trees in (k+c)-edge-connected graphs, with families of extremal graphs identified.