ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple graph with m=∣E(G)∣m=|E(G)| edges and clique number ω(G)\omega(G), and let λ1(G)≥λ2(G)≥⋯≥λn(G)\lambda_1(G)\ge\lambda_2(G)\ge\cdots\ge\lambda_n(G) be the eigenvalues of its adjacency matrix. Bollobás and Nikiforov conjectured in 2007 that every non-complete graph satisfies λ1(G)2+λ2(G)2≤2(1−1ω(G))m.\lambda_1(G)^2+\lambda_2(G)^2\le 2\Bigl(1-\frac{1}{\omega(G)}\Bigr)m. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.