Removal and Stability for Erdös-Ko-Rado

  title={Removal and Stability for Erd{\"o}s-Ko-Rado},
  author={Shagnik Das and Tuan Tran},
  journal={SIAM J. Discret. Math.},
A $k$-uniform family of subsets of $[n]$ is intersecting if it does not contain a disjoint pair of sets. The study of intersecting families is central to extremal set theory, dating back to the seminal Erdos--Ko--Rado theorem of 1961 that bounds the size of the largest such families. A recent trend has been to investigate the structure of set families with few disjoint pairs. Friedgut and Regev proved a general removal lemma, showing that when $\gamma n \le k \le (\tfrac12 - \gamma)n$, a set… 
Structure and properties of large intersecting families
A conclusive version of Frankl's theorem on intersecting families with bounded maximal degree is proved, which strengthens the results obtained by Frankl, Frankl and Tokushige, Kupavskii and Zakharov and others.
On an inverse problem of the Erdős-Ko-Rado type theorems
A family of subsets F ⊆ ( [n] k ) is called intersecting if any two of its members share a common element. Consider an intersecting family, a direct problem is to determine its maximal size and the
Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
The asymptotic size of the largest intersecting family in $\mathcal{H}$ k , for essentially all values of p and k, is settled.
Structure and Supersaturation for Intersecting Families
This paper investigates supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold, and determines the structure of the optimal families.
Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
Ever since the famous Erdős-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various combinatorial objects
On an inverse problem of the Erd\H{o}s-Ko-Rado type theorems
A family of subsets $\mathcal{F}\subseteq {[n]\choose k}$ is called intersecting if any two of its members share a common element. Consider an intersecting family, a direct problem is to determine
Sharp bounds for the chromatic number of random Kneser graphs
Sharp threshold for the Erdős–Ko–Rado theorem
For positive integers n and k with n > 2 k + 1, the Kneser graph K ( n, k ) is the graph with vertex set consisting of all k -sets of { 1 , . . . , n } , where two k -sets are adjacent exactly when
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube
It is proved that if a Boolean function f is close (in $L^2$-distance) to an affine function $\ell(x_1,...,x_n) = c_0 + \sum_i c_i x_i$, then $f$ is close to a Boolean affinefunction (which necessarily depends on at most one coordinate).


For natural numbers $n,r\in \mathbb{N}$ with $n\geqslant r$, the Kneser graph $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\ldots ,n\}$ in which two sets are adjacent if and
Intersecting Families are Essentially Contained in Juntas
It is proved that every intersecting family of k-sets is almost contained in a dictatorship, a 1-junta (which by the Erdős–Ko–Rado theorem is a maximal intersectingfamily), and the methods combine traditional combinatorics with results stemming from the theory of Boolean functions and discrete Fourier analysis.
Most Probably Intersecting Hypergraphs
A rough structural characterisation of the most probably intersecting families is provided and, for families of particular sizes, the initial segment of the lexicographic order is optimal.
On the measure of intersecting families, uniqueness and stability
It is proved, for a certain range of parameters, that the t-intersecting families of maximal measure are the families of all sets containing t fixed elements, and that the extremal examples are not only unique, but also stable.
Erd\H{o}s-Ko-Rado for random hypergraphs: asymptotics and stability
We investigate the asymptotic version of the Erd\H{o}s-Ko-Rado theorem for the random $k$-uniform hypergraph $\mathcal{H}^k(n,p)$. For $2 \leq k(n) \leq n/2$, let $N=\binom{n}k$ and $D=\binom{n-k}k$.
Erdős–Ko–Rado in Random Hypergraphs
It is proved that every non-trivial intersecting k-uniform hypergraph can be covered by k2 − k + 1 pairs, which is sharp as evidenced by projective planes, which improves upon a result of Sanders.
Most Probably Intersecting Families of Subsets
The exact maximum is determined in this paper for some small i.e. families consisting of k-element subsets, but the exact solution is obtained only when the size of the family exceeds the maximumsize of the intersecting family only by one.
Compressions and Probably Intersecting Families
This paper shows that the families [n](≥r) = {A ⊂ [n]: |A| ≥ r} are optimal for the appropriate values of i, thereby proving the conjecture for this sequence of values.
The typical structure of intersecting families of discrete structures
The study of intersecting structures is central to extremal combinatorics. A family of permutations F ⊂ Sn is t-intersecting if any two permutations in F agree on some t indices, and is trivial if
Probably Intersecting Families are Not Nested
It is shown that Katona, Katona and Katona's conjecture that there is a nested sequence consisting of most probably intersecting families of every possible size is false for every value of p provided that n is sufficiently large.