A deletion game on hypergraphs

DOI10.1016/0166-218X(91)90041-TzbMath0728.90106OpenAlexW2037493128MaRDI QIDQ805510

Aviezri S. Fraenkel, Edward R. Scheinerman

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90041-t

zbMATH Keywords

hypergraphcyclescomplete multipartite graphsNimSprague-Grundy functionP-partiteP-uniform

Mathematics Subject Classification ID

2-person games (91A05) Hypergraphs (05C65) Games involving graphs (91A43)

Related Items (8)

Complexity, appeal and challenges of combinatorial games ⋮ Combinatorial analysis of a subtraction game on graphs ⋮ The Complexity of Poset Games ⋮ Unnamed Item ⋮ Edge-removing games on graphs ⋮ A vertex and edge deletion game on graphs ⋮ Recent results and questions in combinatorial game complexities ⋮ Around Wythoff's game

Cites Work

• A complete analysis of von Neumann's Hackendot
• Nim-type games
• A Curious Nim-Type Game
• Unnamed Item
• Unnamed Item

This page was built for publication: A deletion game on hypergraphs