ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each fixed positive integer ℓ divisible by 3, determine the minimum semidegree that forces an n-vertex oriented graph, for all sufficiently large n, to contain a directed cycle of length ℓ, without requiring the cycle to contain a prescribed vertex.

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.