Name
Abstract | ||
|---|---|---|
If a Steiner system S(4,5,17) exists, it would contain derived S(3,4,16) designs. By relying on a recent classification of the S(3,4,16), an exhaustive computer search for S(4,5,17) is carried out. The search shows that no S(4,5,17) exists, thereby ruling out the existence of Steiner systems S(t,t+1,t+13) for t⩾4. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.jcta.2008.04.005 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Derived design,Exact cover problem,Steiner system | Steiner systems,Discrete mathematics,Combinatorics,Existential quantification,Steiner tree problem,Exact cover,Computer search,Mathematics,Steiner system | Journal |
Volume | Issue | ISSN |
115 | 8 | 0097-3165 |
Citations | PageRank | References |
2 | 0.39 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patric R.J. Östergård | 1 | 44 | 6.22 |
| Olli Pottonen | 2 | 86 | 8.99 |