scholarly journals Proof of an Intersection Theorem via Graph Homomorphisms

10.37236/1144 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Irit Dinur ◽  
Ehud Friedgut

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.

2021 ◽  
pp. 262-293
Author(s):  
Pavol Hell ◽  
Jaroslav Nešetřil
Keyword(s):  

2017 ◽  
Vol 27 (1) ◽  
pp. 60-68 ◽  
Author(s):  
PETER FRANKL ◽  
ANDREY KUPAVSKII

A family of subsets of {1,. . .,n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdős, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1,. . .,n}. In this paper we study the following problem: How many intersecting families of k-subsets of {1,. . .,n} are there? Improving a result of Balogh, Das, Delcourt, Liu and Sharifzadeh, we determine this quantity asymptotically for n ≥ 2k+2+2$\sqrt{k\log k}$ and k → ∞. Moreover, under the same assumptions we also determine asymptotically the number of non-trivial intersecting families, that is, intersecting families for which the intersection of all sets is empty. We obtain analogous results for pairs of cross-intersecting families.


2021 ◽  
Author(s):  
Bing Yao ◽  
Xiaohui Zhang ◽  
Jing Su ◽  
Hui Sun ◽  
Hongyu Wang

2016 ◽  
pp. 366-369
Author(s):  
Jin-Yi Cai ◽  
Xi Chen ◽  
Pinyan Lu
Keyword(s):  

2014 ◽  
pp. 66-105
Author(s):  
Ekkehard Kopp ◽  
Jan Malczak ◽  
Tomasz Zastawniak
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document