A deletion game on hypergraphs (Q805510): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(91)90041-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037493128 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deletion game on hypergraphs |
scientific article |
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
