Ustimenko's spectral bound conjecture for components of
Let be a connected component of , and let denote its second largest eigenvalue. Ustimenko's conjecture. For all and ,
This is a universal spectral bound for the components; the source gives no resolution.
References
Primary source
Felix Lazebnik and Ye Wang, “Some families of graphs, hypergraphs and digraphs defined by systems of equations”, arXiv:2503.07915 (2025).
Additional references
2 papers in this index state this conjecture (2023–2025). The statement above is taken from the most recent of them; the others are arXiv:2308.16728.
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.