AbstractWe 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
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.