Spectral extrema of graphs with fixed size: forbidden triangles and pentagons (Q6589128)

This paper presents an important contribution to the study of spectral extremal graphs, extending previous results in the field. The authors address the open problem posed by \textit{W. Sun} and \textit{S. Li} [ibid. 346, No. 7, Article ID 113440, 13 p. (2023; Zbl 1514.05107)], which involves determining the graphs with the largest spectral radius among \(\{C_3, C_5\}\)-free non-bipartite graphs with fixed even number \(m\) of edges. The authors successfully prove the result for \(m>150\). The main technique used in this paper is a careful examination of all possible cases. By applying eigenvalue interlacing, triangle counting lemmas, and eigenvector analysis, the authors establish spectral extremal graphs. The introduction of the paper provides an insightful survey of previous results.