Kelly, Kühn and Osthus's short-cycle conjecture for oriented graphs
Statement
Let be a positive integer, and let be the smallest integer greater than that does not divide . Let denote the minimum semidegree of an oriented graph .
Kelly, Kühn and Osthus's conjecture. There exists an integer such that every oriented graph on vertices with
contains an -cycle.
The conjecture refines known minimum-semidegree thresholds for forcing cycles of prescribed lengths. The supplied text does not state whether it has been resolved.
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.