Cardoso–Luz conjecture on adverse graphs
Statement
An adverse graph is a graph without isolated vertices such that and are integers, and, for every vertex ,
Here is the optimal value of the quadratic stability-number bound and is the least eigenvalue of . A graph is a -graph when it belongs to the class defined in the paper.
Cardoso–Luz conjecture. All adverse graphs are -graphs.
Computational tests with adverse graphs supported the conjecture, but it remains open. Its resolution would clarify the polynomial-time recognition of -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.