On the small covering numbers g1(5)(υ)

被引：0
|
作者：
Forbes, A. D.
Grannell, M. J.
Griggs, T. S.
Stanton, R. G.
机构：
[1] Open Univ, Dept Math & Stat, Milton Keynes MK7 6AA, Bucks, England
[2] Univ Manitoba, Dept Comp Sci, Winnipeg, MB R3T 2N2, Canada
来源：
UTILITAS MATHEMATICA | 2007年 / 74卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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)((5)) (upsilon). As a prelude to further work, we give the values of g(1)((5))(upsilon) for upsilon <= 25, and construct all designs which attain this bound.
引用
收藏
页码：77 / 96
页数：20
相关论文
共 50 条
12345