Brouwer's toughness conjecture for regular graphs
Statement
Let be a connected -regular graph, let denote its toughness, and let be the second largest absolute eigenvalue of the adjacency matrix of . Brouwer's toughness conjecture. For any connected -regular graph ,
Brouwer's conjecture strengthens his eigenvalue bound ; partial results are known, but the source states that no substantial progress had been made for more than two decades before the paper's proof.
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.