Gu's Laplacian spectral Hamiltonicity conjecture

About 5 years old · traced to

Let GG be the graph under consideration, with Laplacian eigenvalues μ2\mu_2 and μn\mu_n, and say that GG is Hamiltonian when it contains a Hamilton cycle. Gu's conjecture. There exists a constant CC with 0<C<10<C<1 such that

μ2μn≥C\frac{\mu_2}{\mu_n}\ge C

and n≥3n\ge 3 (or, alternatively, for sufficiently large nn) imply that GG is Hamiltonian. The source presents this as a stronger Laplacian-eigenvalue analogue of the Krivelevich–Sudakov conjecture and does not report a resolution.

References

Primary source

Xiaofeng Gu and Muhuo Liu, “A unified combinatorial view beyond some spectral properties”, arXiv:2205.15228 (2022).

Additional references

2 papers in this index state this conjecture (2021–2022). The statement above is taken from the most recent of them; the others are arXiv:2104.03845.

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.