ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected block graph, meaning a graph in which every biconnected component is a clique. The nullity of GG is the dimension of the kernel of its adjacency matrix.

Nullity conjecture. If each block of GG has order at least 33, then the nullity of GG is at most 11.

This conjecture concerns the adjacency-matrix nullity of K2K_2-forbidden block graphs. Its resolution is not indicated in the source.

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.