Erdős Problem #72 — A sparse universal set of cycle lengths
Statement
Does there exist a zero-density set of positive integers and a constant such that every sufficiently large graph with average degree at least contains a cycle whose length lies in ?
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.