Intersection theorems for \((- 1, 0, 1)\)-vectors

DOI10.1016/j.ejc.2023.103830arXiv2004.08721MaRDI QIDQ6181997

Peter Frankl, Andrey B. Kupavskii

Publication date: 23 January 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

families of vectorsErdős-Ko-Rado type theorems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• On the hardness of approximating minimum vertex cover
• Intersection theorems with geometric consequences
• Beyond the Erdős-Ko-Rado theorem
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
• Coloring Distance Graphs and Graphs of Diameters
• Families of vectors without Antipodal pairs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Forbidden Intersections
• On the chromatic number of a space
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers

This page was built for publication: Intersection theorems for \((- 1, 0, 1)\)-vectors