A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Generalized packing designs
2013
Discrete Mathematics
Generalized t-designs, which form a common generalization of objects such as t-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835-4842]. In this paper, we define a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays. We describe the sometimes surprising connections which these generalized designs have with various known classes of
doi:10.1016/j.disc.2011.11.039
fatcat:gkjrrj33onbfjcnmujtjc5xqda