ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be the order of a graph, and let a nut graph be a graph whose adjacency matrix is singular with one-dimensional null space spanned by an eigenvector having no zero entries. Vertex and edge orbits are the orbits of the automorphism group on the vertex set and edge set, respectively. BFP's conjecture. For every non-prime integer n≥9n\geq 9, there exists a nut graph Γ\Gamma of order nn with two vertex orbits and three edge orbits. The conjecture refines the known existence of nut graphs with two vertex orbits for every non-prime order n≥9n\geq 9 by requiring exactly three edge orbits.

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.