Families of vectors without antipodal pairs

DOI10.1556/012.2018.55.2.1394MaRDI QIDQ3176686zbMATH OpenOpenAlexFDO

Authors Peter Frankl, Andrey B. Kupavskii

Publication date 23 July 2018

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.07216, http://real.mtak.hu/90052/1/1705.07216.pdf

zbMATH Keywords

antipodal pairsErdős-Ko-Rado theoremfamilies of vectors

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Abstract: Some ErdH{o}s-Ko-Rado type extremal properties of families of vectors from ${-1,0,1}^n$ are considered.

Recommendations

• Large sets of nearly orthogonal vectors
• An extremal problem for families of pairs of subspaces
• Large antipodal families
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• scientific article; zbMATH DE number 17658

Cited in

(8)

• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• A generalization of Kneser graphs
• Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Binary scalar products
• Independence numbers of Johnson-type graphs
• Intersection theorems for \((- 1, 0, 1)\)-vectors
• Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)

This page was built for publication: Families of vectors without antipodal pairs

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