18 citations · 42 across the 38 of their papers we have counts for
6 papers · 2 filters
Decomposing 1-Sperner hypergraphs
Endre Boros, Vladimir Gurvich, Martin Milanič
A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minima…
Slow -Nim
Vladimir Gurvich, Nhan Bao Ho
Given piles of tokens and a positive integer , we study the following two impartial combinatorial games Nim and Nim. In the first (resp. s…
On tame, pet, domestic, and miserable impartial games
Vladimir Gurvich, Nhan Bao Ho
Playing impartial games under the normal and misere conventions may differ a lot. However, there are also many "exceptions" for which the normal and misere plays are very similar.…
On the Sprague-Grundy function of Exact -Nim
Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2
Moore's generalization of the game of {\sc Nim} is played as follows. Let and be two integers such that . Given piles of tokens, two players move alter…
On Equistable, Split, CIS, and Related Classes of Graphs
Endre Boros, Vladimir Gurvich, Martin Milanič
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic st…
On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim}
Endre Boros, Vladimir Gurvich, Nhan Bao Ho +1
Given a hypergraph $\cH \subseteq 2^I \setminus \{\emptyset\}$ on the ground set , we assign to each a nonnegative integer , that is a pile of…