Some balanced complete block designs

DOI10.1007/BF02758127zbMath0292.05004OpenAlexW1976040558MaRDI QIDQ1211517

Shmuel Schreiber

Publication date: 1974

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05)

Related Items

Large sets of \(t\)-designs through partitionable sets: a survey, \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\), Double resolvability of some complete 3-designs, Extremal properties of \(t\)-SEEDs and recursive constructions, The family of t-designs. Part I, On the existence of 2-designs Slambda(2,3,v) without repeated blocks, Locally trivial t-designs and t-designs without repeated blocks, On the maximum number of disjoint triple systems

Cites Work

• Some mappings of periodic groups
• Covering all triples on n marks by disjoint Steiner systems
• An extremal problem in the uniform covering of finite sets
• Unnamed Item
• Unnamed Item