A characterization of type-1 lambda-designs

DOI10.1016/0097-3165(77)90010-3zbMath0354.05026OpenAlexW2019092094MaRDI QIDQ1236545

K. Appert

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90010-3

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items

On the nonuniform Fisher inequality, Exceptions and characterization results for type‐1 λ‐designs, Some characterizations of type-1 \(\lambda\)-designs

Cites Work

• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Some results on λ-designs
• The determination of all λ-designs with λ=3
• Square λ-Linked Designs