Chomp on generalized Kneser graphs and others

DOI10.1007/s00182-019-00697-xzbMath1473.05204arXiv1803.03081OpenAlexW2981817218WikidataQ126975915 ScholiaQ126975915MaRDI QIDQ2230537

Ignacio García-Marco, Kolja Knauer, Luis Pedro Montejano

Publication date: 24 September 2021

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.03081

zbMATH Keywords

combinatorial gamesJohnson graphsthreshold graphsclique compleximpartial gamesgeneralized Kneser graphschomp

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

A vertex and edge deletion game on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
• Chomp on numerical semigroups
• Automorphisms and regular embeddings of merged Johnson graphs
• Nim-type games
• A Curious Nim-Type Game
• David Gale's Subset Take-Away Game
• Zermelo and the early history of game theory

This page was built for publication: Chomp on generalized Kneser graphs and others