arXiv (All)
open access
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
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 w
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- 4-cycle-free induced subgraphs of grid graphs#1325123
- Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers#1118536
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#971390
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#965978
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#799562
Record · ID 1344075
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive