The Park-Pham Theorem with Optimal Convergence Rate
The Electronic Journal of Combinatorics · 19.05.2023 · 30 (2)
DOI: 10.37236/11600 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 19.05.2023. Verfasst von Tolson Bell. Die Arbeit wurde bisher 5-mal zitiert (Crossref).
Abstract (Originalsprache)
Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$ chance of achieving a given monotone property. While their bound in other parameters is optimal up to constant factors for any fixed $\epsilon$, it does not have the optimal dependence on $\epsilon$ as $\epsilon\rightarrow 0$. In this short paper, we prove a version of the Park-Pham Theorem with optimal $\epsilon$-dependence.
Zitieren
APA
Bell, T. (2023). The Park-Pham Theorem with Optimal Convergence Rate. The Electronic Journal of Combinatorics, 30(2). https://doi.org/10.37236/11600
Vancouver
Bell T. The Park-Pham Theorem with Optimal Convergence Rate. The Electronic Journal of Combinatorics. 2023;30(2). doi:10.37236/11600
BibTeX
@article{Bell2023,
author = {Bell, Tolson},
title = {The Park-Pham Theorem with Optimal Convergence Rate},
journal = {The Electronic Journal of Combinatorics},
year = {2023},
volume = {30},
number = {2},
doi = {10.37236/11600}
}
EUVIMED