Turán theorems for even cycles in random hypergraph
Journal of Combinatorial Theory, Series B · 2024-07 · 167 · 23-54
DOI: 10.1016/j.jctb.2024.02.002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Theory, Series B, 2024-07. Verfasst von Jiaxi Nie. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: China Postdoctoral Science Foundation.
Abstract (Originalsprache)
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. The random Tur\'an 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\"os-R\'enyi 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})=\Theta(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\'an numbers of Berge even cycles, which improve previous results of Spiro and Verstra\"ete.
Förderung
- China Postdoctoral Science Foundation
Zitieren
APA
Nie, J. (2024). Turán theorems for even cycles in random hypergraph. Journal of Combinatorial Theory, Series B, 167, 23-54. https://doi.org/10.1016/j.jctb.2024.02.002
Vancouver
Nie J. Turán theorems for even cycles in random hypergraph. Journal of Combinatorial Theory, Series B. 2024;167:23-54. doi:10.1016/j.jctb.2024.02.002
BibTeX
@article{Nie2024,
author = {Nie, Jiaxi},
title = {Turán theorems for even cycles in random hypergraph},
journal = {Journal of Combinatorial Theory, Series B},
year = {2024},
volume = {167},
pages = {23--54},
doi = {10.1016/j.jctb.2024.02.002}
}
EUVIMED