Turán theorems for even cycles in random hypergraph

Abstract

Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. The random Turán number $\mathrm{ex}(G^r_{n,p},\mathcal{F})$ is the maximum number of edges in an $\mathcal{F}$-free subgraph of $G^r_{n,p}$, where $G^r_{n,p}$ is the Erdös-Rényi random $r$-graph with parameter $p$. Let $C^r_{\ell}$ denote the $r$-uniform linear cycle of length $\ell$. For $p\ge n^{-r+2+o(1)}$, Mubayi and Yepremyan showed that $\mathrm{ex}(G^r_{n,p},C^r_{2\ell})\le\max\{p^{\frac{1}{2\ell-1}}n^{1+\frac{r-1}{2\ell-1}+o(1)},pn^{r-1+o(1)}\}$. This upper bound is not tight when $p\le n^{-r+2+\frac{1}{2\ell-2}+o(1)}$. In this paper, we close the gap for $r\ge 4$. More precisely, we show that $\mathrm{ex}(G^r_{n,p},C^r_{2\ell})=Θ(pn^{r-1})$ when $p\ge n^{-r+2+\frac{1}{2\ell-1}+o(1)}$. Similar results have recently been obtained independently in a different way by Mubayi and Yepremyan. For $r=3$, we significantly improve Mubayi and Yepremyan's upper bound. Moreover, we give reasonably good upper bounds for the random Turán numbers of Berge even cycles, which improve previous results of Spiro and Verstraëte.

Figures (1)

• Figure 1: The behaviour of $f_{r,\ell}(x)$ with respect to $x$

Theorems & Definitions (38)

• Theorem 1.1: conlon2016combinatorialschacht2016extremal
• Theorem 1.2: haxell1995turanMORRIS2016534
• Conjecture 1.3: erdHos1982compactness
• Theorem 1.4: mubayi2020random
• Conjecture 1.5: mubayi2020random
• Theorem 1.6
• Theorem 1.7
• Corollary 1.8
• Corollary 1.9
• Theorem 1.10: spiro2022counting