ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An adverse graph is a graph HH without isolated vertices such that upsilon(H)upsilon(H) and lambdamin(H)lambda_{min}(H) are integers, and, for every vertex i∈V(H)i\in V(H),

υ(H−NH(i))=υ(H),λmin(H−NH(i))=λmin(H).\upsilon(H-N_H(i))=\upsilon(H),\qquad \lambda_{min}(H-N_H(i))=\lambda_{min}(H).

Here upsilon(H)upsilon(H) is the optimal value of the quadratic stability-number bound and lambdamin(H)lambda_{min}(H) is the least eigenvalue of HH. A graph is a Q\mathcal{Q}-graph when it belongs to the class Q\mathcal{Q} defined in the paper.

Cardoso–Luz conjecture. All adverse graphs are Q\mathcal{Q}-graphs.

Computational tests with adverse graphs supported the conjecture, but it remains open. Its resolution would clarify the polynomial-time recognition of Q\mathcal{Q}-graphs.

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.