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

DOI10.1016/J.EJC.2023.103830arXiv2004.08721MaRDI QIDQ6181997FDOQ6181997

Peter Frankl, Andrey B. Kupavskii

Publication date: 23 January 2024

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

Abstract: In this paper, we investigate ErdH os--Ko--Rado type theorems for families of vectors from ${0,pm1}^n$ with fixed numbers of $+1$'s and $-1$'s. Scalar product plays the role of intersection size. In particular, we sharpen our earlier result on the largest size of a family of such vectors that avoids the smallest possible scalar product. We also obtain an exact result for the largest size of a family with no negative scalar products.

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

• Title not available (Why is that?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Forbidden Intersections
• Intersection theorems with geometric consequences
• Coloring Distance Graphs and Graphs of Diameters
• On the chromatic number of a space
• The complete intersection theorem for systems of finite sets
• On the hardness of approximating minimum vertex cover
• The exact bound in the Erdős-Ko-Rado theorem
• Beyond the Erdős-Ko-Rado theorem
• 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
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• 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\)
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Families of vectors without Antipodal pairs

Cited In (1)

• Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181997)