ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn and clique number omegaomega. Let s+(G)s^+(G) denote the sum of the squares of the positive eigenvalues of the adjacency matrix of GG. Elphick–Linz–Wocjan conjecture. For any graph GG,

s+(G)≤n(1−1ω).\sqrt{s^+(G)} \leq n\left(1-\frac{1}{\omega}\right).

The conjecture is known for weakly perfect graphs, Kneser graphs, triangle-free graphs and random graphs; the general case remains open.

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.