Bollobás–Nikiforov conjecture
Statement
Let be a finite simple graph with edges and clique number , and let be the eigenvalues of its adjacency matrix. Bollobás and Nikiforov conjectured in 2007 that every non-complete graph satisfies Before this work it was known for triangle-free graphs (Lin, Ning and Wu), regular graphs (Zhang), graphs with few triangles, complete multipartite graphs, and asymptotically almost surely for random graphs, and open in general.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.