A Sharp Version of Talagrand’s Selector Process Conjecture and an Application to Rounding Fractional Covers
Author:
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 322-328
Abstract
No abstract availableAll Related Versions
Funding Information
- Clay Mathematics Institute (Clay Research Fellowship)
This publication has 8 references indexed in Scilit:
- A proof of the Kahn–Kalai conjectureJournal of the American Mathematical Society, 2023
- On a problem of M. TalagrandRandom Structures & Algorithms, 2022
- Thresholds versus fractional expectation-thresholdsAnnals of Mathematics, 2021
- Upper and Lower Bounds for Stochastic Processes2021
- Note on a problem of M. TalagrandRandom Structures & Algorithms, 2014
- Are many small sets explicitly small?2010
- Thresholds and Expectation ThresholdsCombinatorics, Probability and Computing, 2007
- Selector processes on classes of setsProbability Theory and Related Fields, 2006