Brouwer's toughness conjecture for regular graphs
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 ,
References
Status
- Solved: Xiaofeng Gu. A proof of Brouwer’s toughness conjecture (SIAM Journal on Discrete Mathematics, 2021) https://arxiv.org/abs/2010.05065
Source: Xiaofeng Gu, “A proof of Brouwer's toughness conjecture”, arXiv:2010.05065 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.