Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families

zbMath1395.05177arXiv1603.00938MaRDI QIDQ1681899

Peter Frankl, Andrey B. Kupavskii

Publication date: 24 November 2017

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremcross-intersecting familiescomplete intersection theoremintersecting families of vectors

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (4)

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ A generalization of Kneser graphs ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles

This page was built for publication: Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families