학술논문

Note on down-set thresholds
Document Type
Working Paper
Author
Source
Random Structures and Algorithms 64 (2024), 807-813
Subject
Mathematics - Probability
Mathematics - Combinatorics
60C05, 05D40, 05C80
Language
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.
Comment: 5 pages; to appear in Random Structures and Algorithms (RSA)