{
  "abstract": "Let $τ(G)$ denote the maximum number of pairwise edge-disjoint spanning trees contained in a graph $G$. Zhang and Fan [J. Graph Theory, 2026] posed the problem of determining the corresponding tight spectral-radius condition for every $s$-edge-connected graph with \\[ k+1\\leq s\\leq2k-1, \\] together with a characterization of the associated extremal graphs. In this paper, we completely resolve this problem.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.18574",
  "author_total": 4,
  "authors": [
    {
      "name": "Jia Wei"
    },
    {
      "name": "Muhuo Liu"
    },
    {
      "name": "Zhifu You"
    },
    {
      "name": "Hong-Jian Lai"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/d9vaxmkd6bt6k.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.18574",
  "fulltext_url": null,
  "id": "d9vaxmkd6bt6k",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.18574",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2608|Graph theory and applications"
    ]
  ],
  "openalex": "W7221753860",
  "pdf_url": "https://arxiv.org/pdf/2610.18574",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-13",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/d9vaxmkd6bt6k.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:29:20Z",
      "native_id": "2610.18574",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.18574"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity",
  "title_text": "Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity",
  "type": "preprint",
  "updated_at": "2026-10-30T12:29:20Z",
  "url": "https://research.draconitic.com/paper/d9vaxmkd6bt6k",
  "venue": "arXiv",
  "versions": []
}