ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph, and let δ(G)\delta(G) denote its minimum degree. The maximum nullity M(G)\mathrm{M}(G) is the greatest nullity among matrices associated with GG in the maximum nullity problem. Delta Conjecture. For every simple graph GG,

δ(G)≤M(G).\delta(G) \le \mathrm{M}(G).

The conjecture arose in combinatorial matrix theory and is a lower bound on maximum nullity. It is known for all bipartite graphs and for complements of bipartite graphs, but the source does not report a complete 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.