A deletion game on hypergraphs

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free