Classification conjecture for extremal third-eigenvalue graphs

Let GG be a graph and let Ha,bH_{a,b} denote the family of graphs introduced in the paper, where a,ba,b are non-negative integers. Classification conjecture for extremal graphs. If

λ3(G)=V(G)31,\lambda_3(G) = \frac{|V(G)|}{3} - 1,

then GG is isomorphic to Ha,bH_{a,b} for some non-negative integers a,ba,b. 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

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.