Classification conjecture for extremal third-eigenvalue graphs
Classification conjecture for extremal third-eigenvalue graphs
Let be a graph and let denote the family of graphs introduced in the paper, where are non-negative integers. Classification conjecture for extremal graphs. If
then is isomorphic to for some non-negative integers . The conjecture proposes a classification of the graphs attaining the paper's known extremal value for the third largest adjacency eigenvalue; its resolution is not given in the supplied text.
Sources & referencesView supporting material
Primary source
Giacomo Leonida and Sida Li, “On graphs with large third eigenvalue”, arXiv:2501.02563 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.