Ustimenko's spectral bound conjecture for components of
Ustimenko's spectral bound conjecture for components of
From papers
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
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.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.