A Short Proof for an Extension of the Erdős–Ko–Rado Theorem

DOI10.1017/9781316650295.010zbMath1398.05211OpenAlexW4248005375MaRDI QIDQ4686097

Peter Frankl, Andrey B. Kupavskii

Publication date: 9 October 2018

Published in: Connections in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/9781316650295.010

zbMATH Keywords

lexicographic orderPyber's inequalitycross-intersecting families of sets

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (3)

On the arithmetic mean of the size of cross-union families ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ On the size of the product of overlapping families

This page was built for publication: A Short Proof for an Extension of the Erdős–Ko–Rado Theorem