Geodesic
Proof of an intersection theorem via graph homomorphisms
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1144
Classification : 05D05 
@article{10_37236_1144,
     author = {Irit Dinur and Ehud Friedgut},
     title = {Proof of an intersection theorem via graph homomorphisms},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1144},
     zbl = {1087.05060},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1144/}
}
TY  - JOUR
AU  - Irit Dinur
AU  - Ehud Friedgut
TI  - Proof of an intersection theorem via graph homomorphisms
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1144/
DO  - 10.37236/1144
ID  - 10_37236_1144
ER  - 
%0 Journal Article
%A Irit Dinur
%A Ehud Friedgut
%T Proof of an intersection theorem via graph homomorphisms
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1144/
%R 10.37236/1144
%F 10_37236_1144
Irit Dinur; Ehud Friedgut. Proof of an intersection theorem via graph homomorphisms. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1144

Cité par Sources :