← All problems

Brouwer's toughness conjecture for regular graphs

6 years old · traced to

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.
References

Status

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.