A deletion game on hypergraphs
type: Item
instance of: scholarly article
title: A deletion game on hypergraphs
zbMATH Open document ID: 0728.90106
DOI: 10.1016/0166-218X(91)90041-T
author: Aviezri S. Fraenkel
author: Edward Scheinerman
published in: Discrete Applied Mathematics
publication date: 1991-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 4204160
zbMATH Keywords: Sprague-Grundy function
zbMATH Keywords: hypergraph
zbMATH Keywords: Nim
zbMATH Keywords: P-uniform
zbMATH Keywords: P-partite
zbMATH Keywords: cycles
zbMATH Keywords: complete multipartite graphs
MaRDI profile type: Publication
cites work: Q3941433
cites work: Q3944542
cites work: A Curious Nim-Type Game
cites work: Nim-type games
cites work: A complete analysis of von Neumann's Hackendot
full work available at URL: 0166-218x(91)90041-t
OpenAlex ID: W2037493128
description: scientific article; zbMATH DE number 4204160