On a combinatorial game with an applicat
β
L. Csmiraz
π
Article
π
1980
π
Elsevier Science
π
English
β 480 KB
Let A be a finite set and 9 be a family of its subsets. Two players pick m resp. n points alternately from A. I wins if he picks all the points of some element of 9, otherwise II wins. We give a sufficient condition for II to have a winning strategy. Using this we prove the following statement. If i