The graph complement conjecture for minimum rank and maximum nullity
Statement
For a graph on vertices, let be the set of real symmetric matrices whose off-diagonal zero pattern is prescribed by adjacency in . Define as the minimum rank of a matrix in and as the maximum nullity. Graph complement conjecture. For any graph ,
and equivalently
This conjecture gives equivalent formulations in terms of minimum rank and maximum nullity for a graph and its complement; the source presents it as a possible future direction, but the supplied text does not establish its resolution.
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.