A deletion game on hypergraphs
Let H be a finite, simple hypergraph and \(\Gamma\) (H) be the game in which players alternately delete either a vertex or an edge (with all vertices contained in the edge). As in Nim, the first player unable to move loses. The authors solve \(\Gamma\) (H) when H is a disjoint union of hypergraphs which are (1) P-uniform, P-partite; (2) cycles; and (3) complete multipartite graphs.
scientific article; zbMATH DE number 4204160