Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649228 | Discrete Mathematics | 2006 | 9 Pages |
Abstract
We introduce a theory of hypergraphical t-designs. We show the existence of these designs and prove a finiteness theorem on these designs for infinitely many parameter sets. We also give effective bounds on the number of points in these cases. These results generalize some results on graphical t-designs of Alltop, Chee and Betten–Klin–Laue–Wassermann.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ngo Dac Tuan,