← All problems

Zhang–Fan spectral-radius problem for edge-disjoint spanning trees

For integers k≥2k\geq 2 and ss satisfying k+1≤s≤2k−1k+1\leq s\leq 2k-1, determine the sharp spectral-radius condition on every ss-edge-connected graph GG that guarantees τ(G)≥k\tau(G)\geq k, where τ(G)\tau(G) is the maximum number of pairwise edge-disjoint spanning trees of GG. Characterize all extremal graphs for which the condition is tight.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

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 kk edge-disjoint spanning trees in every mm-edge-connected graph, for k+1≤m≤2k−1k+1\le m\le 2k-1, together with the extremal graphs. The problem was posed in 2026.

Known results

  • The cases m=km=k and k=2,m=3k=2,m=3 were already known to Zhang and Fan (2026).
  • A 2026 preprint gives tight conditions for m=k+cm=k+c when 1≤c≤k−21\le c\le k-2 and for m=2k−1m=2k-1, with extremal families; it identifies a unique extremal graph when c=1c=1.
  • The same preprint says that concrete extremal-graph identification remains open for 2≤c≤k−12\le c\le k-1.

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.