Cioabă–Wong spanning tree packing conjecture
Statement
Let be a graph with minimum degree
. For an integer , let
denote the second-largest eigenvalue of the adjacency matrix of $G$, and letbe the maximum number of edge-disjoint spanning trees in . Cioabă–Wong conjecture. If
then
This spectral condition was conjectured to guarantee the existence of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.