ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ℓ≥4\ell\geq4 be a positive integer, and let kk be the smallest integer greater than 22 that does not divide ℓ\ell. Let δ0(G)\delta^0(G) denote the minimum semidegree of an oriented graph GG.

Kelly, Kühn and Osthus's conjecture. There exists an integer n0=n0(ℓ)n_0=n_0(\ell) such that every oriented graph GG on n≥n0n\geq n_0 vertices with

δ0(G)≥⌊nk⌋+1\delta^0(G)\geq\left\lfloor\frac{n}{k}\right\rfloor+1

contains an ℓ\ell-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 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.