Symmetric designs as the solution of an extremal problem in combinatorial set theory

DOI10.1016/S0195-6698(88)80043-XzbMath0654.05007OpenAlexW2089254378MaRDI QIDQ1108273

Robert Calderbank

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80043-x

zbMATH Keywords

Bose-Mesner algebraadjacency matrixJohnson schemeHahn polynomialsymmetric balanced incomplete block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Related Items (4)

Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ An Erdős-Ko-Rado theorem for regular intersecting families of octads ⋮ Intersecting designs from linear programming and graphs of diameter two

Cites Work

• Finite projective spaces and intersecting hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Symmetric designs as the solution of an extremal problem in combinatorial set theory