A spectral condition for odd cycles in graphs (Q2477528)

The following has been proven: Given a graph \(G\) of sufficiently large order \(n\). If the largest eigenvalue \(\mu(G)\) of its adjacency matrix satisfies \(\mu(G) > \sqrt{\lfloor n^2/4\rfloor}\) then \(G\) contains a cycle of length \(t\) for every \(t \leq n/320\). Moreover, the condition is sharp, i.e.\,the complete bipartite graph \(T_2(n)\) with parts of size \(\lfloor n/2\rfloor\) and \(\lceil n/2\rceil\) contains no odd cycles and its largest eigenvalue is equal to \(\sqrt{\lfloor n^2/4\rfloor}\). This condition is also stable, i.e. if \(\mu(G)\) is close to \(\sqrt{\lfloor n^2/4\rfloor}\) and \(G\) does not contain a cycle of length \(t\) for some \(t\leq n/321\), then \(G\) resembles \(T_2(n)\) (there exists an induced bipartite subgraph \(G_0 \subset G\) with \(| G_0| \) close to \(n\) and \(\delta(G_0)\) close to \(n/2\)).