ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a nonnegative integer, and let GG be a kk-diregular oriented graph on at most 4k+14k+1 vertices, where k≠2k\ne 2. Here kk-diregular means that every vertex has indegree and outdegree kk.

Jackson's conjecture. The graph GG contains a directed Hamiltonian circuit.

This conjecture is refuted: the paper's abstract states that a 33-diregular circulant digraph on 1212 vertices is a counterexample. Thus the asserted bound does not guarantee Hamiltonicity in general.

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.