The almost-all-trees lower-bound conjecture for small Laplacian eigenvalues
Let be a tree with diameter , and let denote the number of Laplacian eigenvalues of less than . Almost-all-trees lower-bound conjecture. Almost all trees have at least
Laplacian eigenvalues less than . This would improve the general lower bound by one for asymptotically almost all trees. The statement is presented as a consequence of the conjecture that the proportion of trees attaining the existing lower bound tends to zero; the supplied text also says that this conjecture was confirmed independently by Sin and by Jacobs, Oliveira and Trevisan.
References
- Jiaxin Guo, Jie Xue and Ruifang Liu, “Laplacian eigenvalue distribution, diameter and domination number of trees”, arXiv:2212.05283 (2022).
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.