Intersecting families of discrete structures are typically trivial
From MaRDI portal
Publication:2258906
DOI10.1016/j.jcta.2015.01.003zbMath1307.05199arXiv1408.2559WikidataQ105583647 ScholiaQ105583647MaRDI QIDQ2258906
József Balogh, Hong Liu, Michelle Delcourt, Maryam Sharifzadeh, Shagnik Das
Publication date: 27 February 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2559
permutations; Erdős-Ko-Rado theorem; hypergraphs; extremal combinatorics; vector spaces; Kneser graph; random hypergraphs; intersecting families; Bollobás set-pairs
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs