arXiv (All)
open access
Maximum and Minimum Spectral Radii in an Exceptional Family for Edge-Disjoint Spanning Trees
For a connected graph $G$, let $τ(G)$ denote the maximum number of pairwise edge-disjoint spanning trees, and let $ρ(G)$ be its adjacency spectral radius. For integers $n\ge1$, $k\ge2$, and $k\leδ\le2k-1$, let $\mathcal{G}_{n,δ}$ be the class of connected $n$-vertex graphs with minimum degree $δ$, a
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
- Sharp edge-spectral supersaturation for odd cycles#985469
- The spectral edge of sparse directed Erdös-Rényi graphs#1012556
- Cyclotomic Newton Expansions and a Rank-Uniform Integer-Valued Newton Completion#798226
- Cyclotomic Newton Expansions and a Rank-Uniform Integer-Valued Newton Completion#796813
- A Proof of Füredi's Conjecture#999431
Record · ID 1014244
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