Title
Proof of an Intersection Theorem via Graph Homomorphisms
Abstract
Let 0 <= p <= 1/2 and let {0,1}(n) be enclosed with the product measure mu(p) defined by mu(p)(x) = p(vertical bar x vertical bar) (1-p)(n-vertical bar x vertical bar), where vertical bar x vertical bar = Sigma x(i). Let I subset of {0,1}(n) be an intersecting family i.e. for every x,y epsilon I there exists a coordinate 1 <= i <= n such that x(i) = y(i) = 1. Then mu(p) (I) <= p. Our proof uses measure preserving homorphisms between graphs.
Year
Venue
Keywords
2006
ELECTRONIC JOURNAL OF COMBINATORICS
intersecting families,product measure
Field
DocType
Volume
Discrete mathematics,Intersection theorem,Graph,Combinatorics,Finite set,Polyomino,Polyform,Hexagonal tiling,Perimeter,Homomorphism,Mathematics
Journal
13
Issue
ISSN
Citations 
1.0
1077-8926
3
PageRank 
References 
Authors
0.60
4
2
Name
Order
Citations
PageRank
Irit Dinur1118785.67
Ehud Friedgut244038.93