ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG on nn vertices, let S(G)S(G) be the set of real symmetric matrices whose off-diagonal zero pattern is prescribed by adjacency in GG. Define mr(G)mr(G) as the minimum rank of a matrix in S(G)S(G) and M(G)=n−mr(G)M(G)=n-mr(G) as the maximum nullity. Graph complement conjecture. For any graph GG,

mr(G)+mr(G‾)≤∣G∣+2mr(G)+mr(\overline{G})\leq |G|+2

and equivalently

M(G)+M(G‾)≥∣G∣−2.M(G)+M(\overline{G})\geq |G|-2.

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 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.