Abstract

A (υ, k, t) covering system is a pair ( X, B ) where X is a υ-set of points and B is a family of k-subsets, called blocks, of X such that every t-subset of X is contained in at least one block. The minimum possible number of blocks in a (υ, k, t) covering system is denoted by C(υ, k, t). It is proven that there are exactly three non-isomorphic systems giving C(9, 5, 4) = 30, and a unique system giving C(10, 6, 5) = 50.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.