A characterization of type-1 lambda-designs

DOI10.1016/0097-3165(77)90010-3MaRDI QIDQ1236545zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(3)

• Exceptions and characterization results for type‐1 λ‐designs
• On the nonuniform Fisher inequality
• Some characterizations of type-1 -designs

This page was built for publication: A characterization of type-1 lambda-designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1236545)