A deletion game on hypergraphs (Q805510)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A deletion game on hypergraphs |
scientific article; zbMATH DE number 4204160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deletion game on hypergraphs |
scientific article; zbMATH DE number 4204160 |
Statements
A deletion game on hypergraphs (English)
0 references
1991
0 references
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.
0 references
Sprague-Grundy function
0 references
hypergraph
0 references
Nim
0 references
P-uniform
0 references
P-partite
0 references
cycles
0 references
complete multipartite graphs
0 references
