Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917487940993024 |
|---|---|
| author | Gao, Yongbin Wang, Ligong |
| author_facet | Gao, Yongbin Wang, Ligong |
| contents | Let $τ(G)$ denote the spanning tree packing number of a graph $G$. Recently, Zhang and Fan [J. Graph Theory 112 (2) (2026) 128--144] posed the problem of finding a tight spectral radius condition for an $m$-edge-connected graph $G$ to guarantee $τ(G)\ge k$ for $k+1\le m\le 2k-1$. They solved the cases $m=k$ and $k=2, m=3$. In this paper, we study this problem for all $m=k+c$, where $1\le c\le k-1$. For $1\le c\le k-2$, we obtain a tight spectral radius condition for a $(k+c)$-edge-connected graph to contain $k$ edge-disjoint spanning trees. We also obtain a tight spectral radius condition for $(2k-1)$-edge-connected graphs. In both cases, we give graph families containing all extremal graphs, and the graphs with maximum spectral radius in these families serve as the corresponding extremal graphs. Each graph in these families consists of a large clique and a small remaining part, with certain restrictions on the edges inside the small part and between the two parts. Moreover, for the case $m=k+1$, we further determine the unique extremal graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_21470 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs Gao, Yongbin Wang, Ligong Combinatorics 05C50, 05C05, 05C70 Let $τ(G)$ denote the spanning tree packing number of a graph $G$. Recently, Zhang and Fan [J. Graph Theory 112 (2) (2026) 128--144] posed the problem of finding a tight spectral radius condition for an $m$-edge-connected graph $G$ to guarantee $τ(G)\ge k$ for $k+1\le m\le 2k-1$. They solved the cases $m=k$ and $k=2, m=3$. In this paper, we study this problem for all $m=k+c$, where $1\le c\le k-1$. For $1\le c\le k-2$, we obtain a tight spectral radius condition for a $(k+c)$-edge-connected graph to contain $k$ edge-disjoint spanning trees. We also obtain a tight spectral radius condition for $(2k-1)$-edge-connected graphs. In both cases, we give graph families containing all extremal graphs, and the graphs with maximum spectral radius in these families serve as the corresponding extremal graphs. Each graph in these families consists of a large clique and a small remaining part, with certain restrictions on the edges inside the small part and between the two parts. Moreover, for the case $m=k+1$, we further determine the unique extremal graph. |
| title | Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs |
| topic | Combinatorics 05C50, 05C05, 05C70 |
| url | https://arxiv.org/abs/2604.21470 |