Zhang–Fan spectral-radius problem for edge-disjoint spanning trees
For integers and satisfying , determine the sharp spectral-radius condition on every -edge-connected graph that guarantees , where is the maximum number of pairwise edge-disjoint spanning trees of . Characterize all extremal graphs for which the condition is tight.
References
- Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity — arXiv — Jia Wei, Muhuo Liu, Zhifu You, Hong-Jian Lai
Source: arXiv
Progress summary
A new preprint claims to settle the Zhang–Fan problem completely, but the claim has not received independent mathematical assessment.
Zhang and Fan asked for the sharp spectral-radius criterion guaranteeing edge-disjoint spanning trees in every -edge-connected graph, for , together with the extremal graphs. The problem was posed in 2026.
Known results
- The cases and were already known to Zhang and Fan (2026).
- A 2026 preprint gives tight conditions for when and for , with extremal families; it identifies a unique extremal graph when .
- The same preprint says that concrete extremal-graph identification remains open for .
October 13, 2026 claimed resolution
A preprint by Jia Wei, Muhuo Liu, Zhifu You, and Hong-Jian Lai states that it completely resolves the full Zhang–Fan problem, including the extremal graphs. This is a claim from the preprint, not an independently verified resolution.
Current status (as of October 2026): A preprint claims the full problem is solved, while independent verification is absent and an earlier preprint explicitly left part of the extremal-graph characterization open.
Sources
Solutions 0
No solutions have been posted yet.