ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with minimum degree

andmaximumdegreeand maximum degree

. For an integer k≥2k\geq 2, let

denote the second-largest eigenvalue of the adjacency matrix of $G$, and let

be the maximum number of edge-disjoint spanning trees in GG. Cioabă–Wong conjecture. If

λ2(G)<δ−2k−1δ+1,\lambda_2(G)<\delta-\frac{2k-1}{\delta+1},

then

τ(G)≥k.\tau(G)\geq k.

This spectral condition was conjectured to guarantee the existence of kk edge-disjoint spanning trees. The conjecture is finally settled in.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.