Jackson's hamiltonicity conjecture for diregular oriented graphs
Statement
Let be a nonnegative integer, and let be a -diregular oriented graph on at most vertices, where . Here -diregular means that every vertex has indegree and outdegree .
Jackson's conjecture. The graph contains a directed Hamiltonian circuit.
This conjecture is refuted: the paper's abstract states that a -diregular circulant digraph on 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.