A deletion game on hypergraphs

DOI10.1016/0166-218X(91)90041-TzbMATH Open0728.90106OpenAlexW2037493128MaRDI QIDQ805510FDOQ805510

Authors: Aviezri S. Fraenkel, Edward 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

Recommendations

• Impartial hypergraph games
• scientific article; zbMATH DE number 6438474
• A vertex and edge deletion game on graphs
• Sprague-Grundy function of symmetric hypergraphs
• Sprague-Grundy function of matroids and related hypergraphs

zbMATH Keywords

cycleshypergraphcomplete multipartite graphsNimSprague-Grundy functionP-partiteP-uniform

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A complete analysis of von Neumann's Hackendot
• A Curious Nim-Type Game
• Nim-type games

Cited In (16)

• Around Wythoff's game
• Complexity, appeal and challenges of combinatorial games
• Combinatorial analysis of a subtraction game on graphs
• Title not available (Why is that?)
• Vertex deletion games with parity rules
• Games without repetitions on trees and multitrees
• Recent results and questions in combinatorial game complexities
• The complexity of poset games
• Bart--Moe games, JumbleG and discrepancy
• A deletion game on graphs: ``Le Pic Arête
• Delete nim
• Edge deletion games with parity rules
• A codex of \(\mathcal{N}\)- and \(\mathcal{P}\)-positions in Harary's `caterpillar game'
• A vertex and edge deletion game on graphs
• Impartial hypergraph games
• Edge-removing games on graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805510)