The intersecting-family success-probability conjecture
Statement
Let , and let be the uniform measure on . An intersecting family is a set such that for every there is a coordinate with . Let be the maximum of over -tuples of intersecting families, and let
Intersecting-family conjecture. The success probability tends to as grows. This is stronger than the dictatorship version because every dictatorship is an intersecting family; the paper relates it to the normalized independence number of Hamming powers of Kneser graphs.
Record
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.