# On Erdős–Ko–Rado for Random Hypergraphs II

@article{Hamm2018OnEF,
title={On Erdős–Ko–Rado for Random Hypergraphs II},
author={Arran Hamm and Jeff Kahn},
journal={Combinatorics, Probability and Computing},
year={2018},
volume={28},
pages={61 - 80}
}
• Published 23 June 2014
• Mathematics
• Combinatorics, Probability and Computing
Denote by ${\mathcal H}_k$(n, p) the random k-graph in which each k-subset of {1,. . .,n} is present with probability p, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a fixed ε > 0 such that if n = 2k + 1 and p > 1 - ε, then w.h.p. (that is, with probability tending to 1 as k → ∞), ${\mathcal H}_k$(n, p) has the ‘Erdős–Ko–Rado property’. We also mention a similar random version of Sperner's theorem.
Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
• Mathematics
Combinatorics, Probability and Computing
• 2017
The asymptotic size of the largest intersecting family in $\mathcal{H}$ k , for essentially all values of p and k, is settled.
Sharp threshold for the Erdős–Ko–Rado theorem
• Mathematics
Random Structures &amp; Algorithms
• 2022
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
A sharp threshold for a random version of Sperner's Theorem
• Mathematics
• 2022
The Boolean lattice P ( n ) consists of all subsets of [ n ] = { 1 , . . . , n } partially ordered under the containment relation. Sperner’s Theorem states that the largest antichain of the Boolean
The Number of Maximal Independent Sets in the Hamming Cube
• Mathematics
Combinatorica
• 2022
Let $Q_n$ be the $n$-dimensional Hamming cube and $N=2^n$. We prove that the number of maximal independent sets in $Q_n$ is asymptotically $2n2^{N/4},$ as was conjectured by Ilinca and the first
Introduction to Random Graphs
• Computer Science
• 2016
All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.
Problems in combinatorics: Hamming cubes and thresholds
OF THE DISSERTATION PROBLEMS IN COMBINATORICS: HAMMING CUBES AND THRESHOLDS
On Erdős–Ko–Rado for random hypergraphs I
• Mathematics
Combinatorics, Probability and Computing
• 2019
The Erdős–Ko–Rado property (or is EKR) is given if each of its largest intersecting subfamilies has non-empty intersection.