Skip to Main content Skip to Navigation
Journal articles

Chomp on generalized Kneser graphs and others

Abstract : In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit strategy be devised? We answer these questions (and determine the Nim-value) for the class of generalized Kneser graphs and for several families of Johnson graphs. We also generalize some of these results to the clique complexes of these graphs. Furthermore, we determine which player has a winning strategy for some classes of threshold graphs.
Document type :
Journal articles
Complete list of metadatas
Contributor : Kolja Knauer <>
Submitted on : Friday, March 15, 2019 - 10:20:08 AM
Last modification on : Monday, May 11, 2020 - 11:00:11 AM

Links full text




Ignacio García-Marco, Kolja Knauer, Luis Pedro Montejano. Chomp on generalized Kneser graphs and others. International Journal of Game Theory, Springer Verlag, 2019, ⟨10.1007/s00182-019-00697-x⟩. ⟨hal-02068632⟩



Record views