Erdős Problem #72 — A sparse universal set of cycle lengths
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 ?
References
Primary source
Additional references
P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas 2 (1995), 165–186.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.