Name
Abstract | ||
|---|---|---|
In this article we look at pair covering designs with a block size of 5 and v=0(mod4). The number of blocks in a minimum covering design is known as the covering number C(v,5,2). For v=<24, these values are known, and all but v=8 exceed the Schonheim bound, L(v,5,2)[email protected]__ __v/[email protected]__ __(v-1)/[email protected]__ [email protected]__ __. However, for all v>=28 with v=0(mod4), it seems probable that C(v,5,2)=L(v,5,2). We establish this for all but 17 possible exceptional values lying in the range 40= |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2006.09.026 | Discrete Mathematics |
Keywords | Field | DocType |
isbcd,resolvable,gdd,covering design,pbd,sbcd | Block size,Discrete mathematics,Combinatorics,Covering number,Block design,Mathematics | Journal |
Volume | Issue | ISSN |
307 | 14 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.59 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Julian R. Abel | 1 | 104 | 10.94 |
| Ahmed Assaf | 2 | 5 | 0.59 |
| Frank E. Bennett | 3 | 41 | 11.26 |
| iliya bluskov | 4 | 7 | 3.88 |
| Malcolm Greig | 5 | 53 | 13.84 |