Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
3 problems
showing 1–3
By (10) they occur in inverse pairs, with 1 an eigenvalue for all odd n; how big is the largest?
Another problem worth mentioning is whether the lower bound for c_2(G) still holds without the regularity assumptions, i.e. if we only assume that the graph has large girth and the degree of each vertex is greater than 2.
There exists t_0 ∈ N such that m_G_t(-∞, -2) is constant for all t ≥ t_0.