An exact result for (0, 1)-vectors

DOI10.1007/S11590-018-1245-YzbMATH Open1394.05135OpenAlexW2794697856MaRDI QIDQ723491FDOQ723491

Authors: 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

Recommendations

• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case
• Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families
• scientific article; zbMATH DE number 4184280
• Large sets of nearly orthogonal vectors

zbMATH Keywords

inequalitieshypergraphsvectorsErdős-Ko-Rado theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

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