The spectral Turán problem: Characterizing spectral-consistent graphs

Longfei Fang, Sergey Goryainov, Denis Krotov +2

Let $\mathrm{EX}(n,H)$ and $\mathrm{SPEX}(n,H)$ denote the families of $H$-free graphs of order $n$ with maximum size and maximum spectral radius, respectively. A graph $H$ is called spe…