Two new combinatorial problems involving dominating sets for lottery schemes

Grundlingh, Werner R. (Stellenbosch : University of Stellenbosch, 2004-12)


Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered n-subsets from the same universal set prior to a winning draw, and is awarded a prize if ...

Please refer to this item in SUNScholar by using the following persistent URL:
This item appears in the following collections: