A Proof of the Kahn-Kalai Conjecture
Jinyoung Park, Huy Tuan Pham
2022Year
6Citations
5Top-tier citations
Abstract
Proving the “expectation-threshold” conjecture of Kahn and Kalai, we show that for any increasing property on a finite set X,equationp_c(F)=O(q(F)(F)),equationwhere and are the threshold and “expectation threshold” of , and is the maximum size of a minimal member of .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ad25f905-bc46-4dfd-8808-12eebd35d2e9Cited by top-tier papers5
- Optimal thresholds for Latin squares, Steiner Triple Systems, and edge coloringsVishesh Jain, Huy Tuan PhamSODA 2024 · 5 citations
- Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust DaisiesGuy Goldberg, Tom Gur, Sidhant SaraogiSTOC 2026 · 5 citations
- The Proof Analysis ProblemNoel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan KhanikiFOCS 2025 · 4 citations
- A Sharp Version of Talagrand's Selector Process Conjecture and an Application to Rounding Fractional CoversHuy Tuan PhamSTOC 2025 · 1 citation
- Memory Reallocation with Polylogarithmic OverheadCe JinSTOC 2026 · 1 citation
Builds on1
Related papers
- The query complexity of certificationGuy Blanc, Caleb Koch, Jane Lange, Li-Yang TanSTOC 2022 · 1 citation
- Sharp threshold results for computational complexityLijie Chen, Ce Jin, R. Ryan WilliamsSTOC 2020 · 2 citations
- A Tight Bound for Testing Partition PropertiesAsaf Shapira, Henrique StagniSODA 2024 · 2 citations
- Improved Local Computation Algorithm for Set Cover via SparsificationChristoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali VakilianSODA 2020 · 8 citations
- Logics for Sizes with Union or IntersectionCaleb Kisby, Saúl A. Blanco, Alex Kruckman, Lawrence S. MossAAAI 2020 · 2 citations
