On the union of intersecting families

DOI10.1017/S096354831900004XzbMath1436.05108arXiv1610.03027MaRDI QIDQ5222559

Noam Lifshitz, David Ellis

Publication date: 6 April 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.03027

zbMATH Keywords

influence-based method

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (2)

Sharp bounds for the chromatic number of random Kneser graphs ⋮ Trivial colors in colorings of Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Extremal problems concerning Kneser-graphs
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Correlation inequalities on some partially ordered sets
• Contributions to the geometry of Hamming spaces
• On a biased edge isoperimetric inequality for the discrete cube
• Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
• The Size of a Hypergraph and its Matching Number
• Thresholds and Expectation Thresholds
• An approximate zero-one law
• Families of Non-disjoint subsets

This page was built for publication: On the union of intersecting families