Two players alternately select either a vertex or an edge of a hypergraph H, deleting it together with all the edges containing the selected vertex or edge. The player first unable to move loses and the other player wins. We analyze the game for simple classes of hypergraphs, and discuss various related questions. © 1991.
Fraenkel, A. S., & Scheinerman, E. R. (1991). A deletion game on hypergraphs. Discrete Applied Mathematics, 30(2–3), 155–162. https://doi.org/10.1016/0166-218X(91)90041-T