An Erdős-Ko-Rado theorem for regular intersecting families of octads

DOI10.1007/BF01788105zbMath0616.05010OpenAlexW2015001393MaRDI QIDQ1821104

Andries E. Brouwer, Robert Calderbank

Publication date: 1986

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

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

zbMATH Keywords

Golay codequasi-symmetric design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Related Items

Strongly regular graphs with strongly regular decomposition, Geometric invariants for quasi-symmetric designs, Quasi-symmetric designs with the difference of block intersection numbers two

Cites Work

• Unnamed Item
• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• Quasi-symmetric designs and self-dual codes
• Finite projective spaces and intersecting hypergraphs
• Symmetric designs as the solution of an extremal problem in combinatorial set theory
• Near-regularity conditions for designs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Coxeter–Todd lattice, the Mitchell group, and related sphere packings
• Nonexistence of a uniformly packed [70,58,5 code (Corresp.)]