← All problems

Conlon's conjecture on the extremal number of fixed-length tight cycles

6 years old · traced to

Let r≥2r\geq 2 and let Cℓ(r)C^{(r)}_{\ell} denote the rr-uniform tight cycle of length ℓ\ell. Conlon's conjecture. There exists c=c(r)>0c=c(r)>0 such that, for every ℓ≥r+1\ell\geq r+1 divisible by rr,

ex⁡(n,Cℓ(r))=O(nr−1+cℓ).\operatorname{ex}(n,C^{(r)}_{\ell})=O\left(n^{r-1+\frac{c}{\ell}}\right).

This is a conjecture about the extremal number of tight cycles of each fixed admissible length.

References

Status

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.