Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability (original) (raw)
Related papers
Erd H{o}s-Ko-Rado for random hypergraphs: asymptotics and stability
2014
A note on uniform intersecting families with maximum transversal size
2014
On Randomly Generated Intersecting Hypergraphs
The Electronic Journal of Combinatorics
On hypergraphs without two edges intersecting in a given number of vertices
Journal of Combinatorial Theory, Series A, 1984
Randomly generated intersecting hypergraphs II
Random Structures and Algorithms, 2006
On the maximum number of points in a maximal intersecting family of finite sets
Combinatorica, 2015
Uniformity thresholds for the asymptotic size of extremal Berge- F -free hypergraphs
Electronic Notes in Discrete Mathematics, 2017
The VC dimension ofk-uniform random hypergraphs
Random Structures and Algorithms, 2007
An Erd H os--Ko--Rado theorem for cross ttt-intersecting families
2013
On subgraphs of C2k-free graphs and a problem of Kühn and Osthus
Combinatorics, Probability and Computing, 2020
Intersection Graphs of k-uniform Linear Hypergraphs
European Journal of Combinatorics, 1982
An asymptotic resolution of a conjecture of Szemer\'{e}di and Petruska
arXiv (Cornell University), 2022
On the representing number of intersecting families
Archiv der Mathematik, 1987
Improved lower bounds onk-independence
Journal of Graph Theory, 1991
Probabilistic Extensions of the Erdős–Ko–Rado Property
Methodology and Computing in Applied Probability, 2006
Union - free Hypergraphs and Probability Theory
European Journal of Combinatorics, 1984
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families
Graphs and Combinatorics, 2006
A generalization of Hunter’s bound to hypergraphs
Annals of Operations Research, 2018
The de Bruijn-Erdos Theorem for hypergraphs
2010
Towards Ryser's Conjecture: Bounds on the Cardinality of Partitioned Intersecting Hypergraphs
2020
N ov 2 01 9 Non-trivial d-wise Intersecting families
2019
Asymptotic upper bounds on the shades of t-intersecting families
Eprint Arxiv 0808 1434, 2008
On the maximum size of (p,Q)-free families
Discrete Mathematics, 2002
Improved Bounds on Families Under k-wise Set-Intersection Constraints
Graphs and Combinatorics, 2007
Sharp thresholds for hypergraph regressive Ramsey numbers
Andreas Weiermann, Lorenzo Carlucci
Journal of Combinatorial Theory, Series A, 2011
Elementary techniques for Erdos-Ko-Rado-like theorems
Arxiv preprint arXiv:0808.0774, 2008
A new generalization of the Erdős-Ko-Rado theorem
Combinatorica, 1983
On Chromatic Number of Kneser Hypergraphs
Resonance, 1997
On Helly hypergraphs with variable intersection sizes
Closed Intersecting Families of finite sets and their applications