Erdős's conjecture on 5-cycles in triangle-free graphs
Let be a triangle-free graph on vertices. Erdős's conjecture. The graph contains at most cycles of length .
References
Status
- Solved: Andrzej Grzesik. On the maximum number of five-cycles in a triangle-free graph (Journal of Combinatorial Theory, Series B 102 (2012), 1061–1066, 2012) https://arxiv.org/abs/1102.0962
Source: Jorik Jooken, “Computer-assisted graph theory: a survey”, arXiv:2508.20825 (2025).
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.