The high order spectral radius of graphs without long cycles or paths

Yuntian Wang, Lizhu Sun, Changjiang Bu

In 1959, Erdős and Gallai established two classic theorems, which determine the maximum number of edges in an $n$-vertex graph with no cycles of length at least $k$, and in an $n$…