Positive random-subgraph independence-gap conjecture
Statement
For a graph , let be the maximum uniform measure of an independent set. Let be the largest expected normalized size of an independent set found inside a positively correlated random union of vertex parts, and define
Positive random-subgraph independence-gap conjecture. for all . This conjecture is proposed as a general statement about independent sets in random subgraphs; the paper explains that it would imply decay of normalized independence numbers for Hamming powers of the Kneser graph and thus Levine's conjecture.
Record
- Source
- Ehud Friedgut, Gil Kalai and Guy Kindler, “The success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs”, arXiv:2103.01541 (2021).
- MathDB
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.