Erdős Problem #1016

Let $h(n)$ be minimal such that there is a graph on $n$ vertices with $n+h(n)$ edges which contains a cycle on $k$ vertices, for all $3\leq k\leq n$. Estimate $h(n)$. In particular, is it true that\[h(n) \geq \log_2n+\log_*n-O(1),\]where $\log_*n$ is the iterated logarithmic function?

#1016: [Er71]

graph theory | cycles

Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.

Such graphs are called pancyclic. A problem of Bondy [Bo71], who claimed a proof (without details) of\[\log_2(n-1)-1\leq h(n) \leq \log_2n+\log_*n+O(1).\]Erdős [Er71] believed the upper bound is closer to the truth, but could not even prove $h(n)-\log_2n\to \infty$.

A proof of the above lower bound is provided by Griffin [Gr13]. The first published proof of the upper bound appears to be in Chapter 4.5 of George, Khodkar, and Wallis [GKW16].

View the LaTeX source

This page was last edited 27 December 2025.

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Related OEIS sequences: A105206

1 comment on this problem

Likes this problem	None
Interested in collaborating	None
Currently working on this problem	None
This problem looks difficult	None
This problem looks tractable	None

Additional thanks to: Terence Tao

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #1016, https://www.erdosproblems.com/1016, accessed 2026-01-16