Sets of vectors with many orthogonal pairs

DOI10.1007/BF02351595zbMath0768.05005OpenAlexW2080598978MaRDI QIDQ1205349

Richard P. Stanley, Zoltan Fueredi

Publication date: 1 April 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02351595

zbMATH Keywords

chromatic numberorthogonal pairErdős' conjectureresearch problems

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (6)

Almost orthogonal subsets of vector spaces over finite fields ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Almost-equidistant sets ⋮ Sets with many pairs of orthogonal vectors over finite fields ⋮ Orthonormal representations of \(H\)-free graphs ⋮ A universal partition result for infinite homogeneous \(K_n\)-free and related graphs

Cites Work

• Unnamed Item
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• Forbidden Intersections
• The realization of distances within sets in Euclidean space

This page was built for publication: Sets of vectors with many orthogonal pairs