| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655353 | Journal of Combinatorial Theory, Series A | 2014 | 13 Pages |
Abstract
In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t-(v,k,Î) design with t finite, v infinite and k,λ
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Danziger, Daniel Horsley, Bridget S. Webb,