ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D(n,t)\mathcal{D}(n,t) denote the graph used in the construction, let F3F_3 and F5F_5 be the graphs shown in the paper, and let □⁡\operatorname{\Box} denote the Cartesian product of graphs. A nut graph is a graph whose adjacency matrix has nullity one and whose corresponding nullvector has no zero entries. The constructions below are considered for integers t≥1t\geq 1. Regular nut graph construction conjecture. The following statements hold:

  1. D(4t+6,t)□⁡F5\mathcal{D}(4t+6,t)\operatorname{\Box}F_5 is a nut graph of degree 4t+54t+5 for every t≥1t\geq 1.
  2. D(4t+6,t)□⁡F3\mathcal{D}(4t+6,t)\operatorname{\Box}F_3 is a nut graph of degree 4t+34t+3 for t≥1t\geq 1 such that t≢0(mod3)t\not\equiv 0\pmod{3}.
  3. D(4t+10,t)□⁡F3\mathcal{D}(4t+10,t)\operatorname{\Box}F_3 is a nut graph of degree 4t+34t+3 for t≥1t\geq 1 such that t≡0(mod3)t\equiv 0\pmod{3}.

These constructions would provide infinite families of regular nut graphs in the specified degrees. The claim is presented as a conjecture in the source, and no resolution is supplied here.

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.