Displaying 21 – 40 of 80

Showing per page

Game saturation of intersecting families

Balázs Patkós, Máté Vizer (2014)

Open Mathematics

We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = 1, 2, …, n alternately, one at each turn, so that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed k-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone...

Macaulay posets.

Bezrukov, Sergei L., Leck, Uwe (2004)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 21 – 40 of 80