Abstract | ||
---|---|---|
Let p ≤ 1/2 and let µp be the product measure on {0, 1}n, where µp(x) = pΣxi(1 - p)n-Σxi. Let A ⊂ {0, 1}n be an intersecting family, i.e. for every x, y ∈ A there exists 1 ≤ i ≤ n such that xi = Yi = 1. Then µp(A) ≤ p. Our proof uses a probabilistic trick first applied by Katona to prove the Erdös-Ko-Rado theorem. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1016/j.jcta.2004.12.004 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
probabilistic trick,s-ko-rado-type theorem,intersecting family,katona-type proof,s-ko-rado theorem,product measure | Discrete mathematics,Combinatorics,Product measure,Existential quantification,Mathematics | Journal |
Volume | Issue | ISSN |
111 | 2 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
1 | 0.49 | 2 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ehud Friedgut | 1 | 440 | 38.93 |