Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
From MaRDI portal
Publication:1689038
DOI10.1016/j.jcta.2017.11.003zbMath1441.05215arXiv1510.03912OpenAlexW2291857129MaRDI QIDQ1689038
Peter Frankl, Andrey B. Kupavskii
Publication date: 12 January 2018
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.03912
Related Items (17)
Diversity of uniform intersecting families ⋮ Binary scalar products ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ A generalization of Kneser graphs ⋮ Independence numbers of Johnson-type graphs ⋮ Intersection theorems for \((- 1, 0, 1)\)-vectors ⋮ On the chromatic numbers of some distance graphs ⋮ On dividing sets into parts of smaller diameter ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ On the \(d\)-cluster generalization of Erdős-Ko-Rado ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ Degree versions of theorems on intersecting families via stability ⋮ Unnamed Item ⋮ Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Intersection theorems with geometric consequences
- Regular bipartite graphs and intersecting families
- 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
- On the chromatic numbers of low-dimensional spaces
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- A counterexample to Borsuk’s conjecture
- Families of vectors without Antipodal pairs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
- Combinatorial Geometry and Coding Theory*
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
This page was built for publication: Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
