Resolution of a problem of Mohar on non-positive inertia

Source abstract

For a graph $G$ of order $n$, its positive, negative and non-positive inertia is the number of positive, negative and non-positive eigenvalues of its adjacency matrix $A(G)$, respectively. Mohar asked whether every graph with $k$ non-positive eigenvalues has order $O(k^2)$ as $k\to \infty$. Using NEPS, we construct a sequence of non-singular graphs with negative inertia $k$ and order $Ω(k^{\frac{7}{3}})$ as $k\to \infty$, thus resolving Mohar's problem. Our result also strongly refutes a recent conjecture of Akbari, Elphick, Kumar, Pragada, and Tang involving positive and negative inertia.