Some bounds for the number of blocks

DOI10.1006/EUJC.2000.0424MaRDI QIDQ1840833zbMATH OpenOpenAlexFDO

Authors Ryuzaburou Noda

Publication date 28 November 2001

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

Full work available at URL https://doi.org/10.1006/eujc.2000.0424

zbMATH Keywords

blocksboundsSteiner systems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10)

Review text

Upper bounds for the number of blocks of \((d,k,v)\)-sets are given. Only a few Steiner systems are known to achieve some of the upper bounds. Necessary conditions for the existence of \((d,k,v)\)-sets are also given. For Part II see Zbl 0973.05006 below.

Recommendations

• Some bounds for the number of blocks. II
• scientific article; zbMATH DE number 3915089
• Blocking Sets in S(4, 5, v) and S(5, 6, v) Steiner Systems
• scientific article; zbMATH DE number 4125410
• Some bounds for the number of blocks. III.

Cites work

• Eine Charakterisierung des Steinersystems S(5,8,24)
• scientific article; zbMATH DE number 3520420 (Why is no real title available?)

Cited in

(6)

• Optimal block size for set-valued attributes
• Some bounds for the number of blocks. II
• On the effective block size in Harper's theorem
• Some bounds for the number of blocks. III.
• On extensions of some block designs
• The number of partial Steiner systems and d-partitions

This page was built for publication: Some bounds for the number of blocks

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