Conlon's conjecture on the extremal number of fixed-length tight cycles
Let and let denote the -uniform tight cycle of length . Conlon's conjecture. There exists such that, for every divisible by ,
This is a conjecture about the extremal number of tight cycles of each fixed admissible length.
References
Status
- Solved: Oliver Janzer. Extremal numbers and Sidorenko’s conjecture (arXiv, 2023) https://arxiv.org/abs/2307.04588
Source: Benny Sudakov and István Tomon, “The extremal number of tight cycles”, arXiv:2009.00528 (2020).
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.