ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected dd-regular graph, let t(G)t(G) denote its toughness, and let λ\lambda be the second largest absolute eigenvalue of the adjacency matrix of GG. Brouwer's toughness conjecture. For any connected dd-regular graph GG,

t(G)≥dλ−1.t(G)\ge \frac{d}{\lambda}-1.

Brouwer's conjecture strengthens his eigenvalue bound t(G)>dλ−2t(G)>\frac{d}{\lambda}-2; 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 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.