On the small covering numbers g_1~(5)(v)

摘要

The minimum number of blocks having maximum size precisely five that is required to cover, exactly once, all pairs of elements from a set of cardinality v is denoted by g_1(v). As a prelude to further work, we give the values of g_1(v) for v < 25, and construct all designs which attain this bound.