On symmetric intersecting families of vectors

DOI10.1017/S0963548321000079MaRDI QIDQ5886116

Sophie Spirkl, Sean Eberhard, Bhargav P. Narayanan, Jeffry Kahn

Publication date: 30 March 2023

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

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

zbMATH Keywords

Erdős-Ko-Rado theoremBoolean hypercube

Mathematics Subject Classification ID

Extremal set theory (05D05) Group actions on combinatorial structures (05E18)

Cites Work

• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• An ordered version of the Erdős-Ko-Rado theorem
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• Beyond the Erdős-Ko-Rado theorem
• The influence of variables in product spaces
• On symmetric intersecting families
• Cross-intersecting families of vectors
• Independent sets in graph powers are almost contained in juntas
• Intersecting families of finite sets and fixed-point-free 2-elements
• Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado
• On symmetric 3-wise intersecting families
• On regular 3-wise intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Regularity Conditions and Intersecting Hypergraphs
• An approximate zero-one law
• Kneser graphs are like Swiss cheese
• Every monotone graph property has a sharp threshold
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Erdős-Ko-Rado theorem for integer sequences

This page was built for publication: On symmetric intersecting families of vectors