Proof of an intersection theorem via graph homomorphisms (Q819191)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proof of an intersection theorem via graph homomorphisms |
scientific article; zbMATH DE number 5014326
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of an intersection theorem via graph homomorphisms |
scientific article; zbMATH DE number 5014326 |
Statements
Proof of an intersection theorem via graph homomorphisms (English)
0 references
22 March 2006
0 references
Summary: Let \(0 \leq p \leq 1/2 \) and let \(\{0,1\}^n\) be endowed with the product measure \(\mu_p\) defined by \(\mu_p(x)=p^{|x|}(1-p)^{n-|x|}\), where \(|x|=\sum x_i\). Let \(I \subseteq \{0,1\}^n\) be an intersecting family, i.e. for every \(x, y \in I\) there exists a coordinate \(1 \leq i \leq n\) such that \(x_i=y_i=1\). Then \(\mu_p(I) \leq p.\) Our proof uses measure preserving homomorphisms between graphs.
0 references