An exact result for \((0, \pm 1)\)-vectors

DOI10.1007/S11590-018-1245-YzbMath1394.05135OpenAlexW2794697856MaRDI QIDQ723491

Peter Frankl

Publication date: 31 July 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/90076/1/Deza_An_exact_result.pdf

zbMATH Keywords

inequalitiesErdős-Ko-Rado theoremhypergraphsvectors

Mathematics Subject Classification ID

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

Related Items (1)

Preface: Special issue on distances in optimization and graphs dedicated to the memory of Michel Deza

Cites Work

• Unnamed Item
• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• On the maximum number of permutations with given maximal or minimal distance
• 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
• Intersecting systems of signed sets
• Borsuk's problem and the chromatic numbers of some metric spaces
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• Intersecting families of permutations
• Intersecting families of permutations

This page was built for publication: An exact result for \((0, \pm 1)\)-vectors