Note on down-set thresholds
Probability
2024-05-22 v2 Combinatorics
Abstract
Gunby-He-Narayanan showed that the logarithmic gap predictions of Kahn-Kalai and Talagrand (proved by Park-Pham and Frankston-Kahn-Narayanan-Park) about thresholds of up-sets do not apply to down-sets. In particular, for the down-set of triangle-free graphs, they showed that there is a polynomial gap between the threshold and the factional expectation threshold. In this short note we give a simpler proof of this result, and extend the polynomial threshold gap to down-sets of F-free graphs.
Cite
@article{arxiv.2310.11662,
title = {Note on down-set thresholds},
author = {Lutz Warnke},
journal= {arXiv preprint arXiv:2310.11662},
year = {2024}
}
Comments
5 pages; to appear in Random Structures and Algorithms (RSA)