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 an 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.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Berlekamp ER, Conway JH, Guy RK (2001) Winning ways for your mathematical plays, 2nd edn. A K Peters Ltd, Wellesley
Bouton CL (1902) Nim, a game with a complete mathematical theory. Ann Math 3:35–39
Brouwer AE The game of Chomp, https://www.win.tue.nl/~aeb/games/chomp.html
Brouwer AE, Christensen JD Counterexamples to Conjectures About Subset Takeaway and Counting Linear Extensions of a Boolean Lattice. ArXiv preprint arXiv:1702.03018 [math.CO]
Brouwer AE, Cohen AM, Neumaier A (1989) Distance-regular graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], 18. Springer-Verlag, Berlin
Christensen JD, Tilford M (1997) David Gale’s subset take-away game. Amer Math Mon 104:762–766
Draisma J, van Rijnswou S (2002) How to chomp forests, and some other graphs. Preprint. https://www.win.tue.nl/~aeb/games/graphchomp.pdf
Fenner SA, Rogers J (2015) Combinatorial game complexity: an introduction with poset games. Bull Eur Assoc Theor Comput Sci EATCS 116:42–75
Gale D (1974) A curious Nim-type game. Amer Math Mon 81:876–879
Gale D, Neyman A (1982) Nim-type games, internat. J Game Theory 11:17–20
García-Marco I, Knauer K (2017) Chomp on numerical semigroups. Accepted in algebraic combinatorics. Arxiv preprint ArXiv:1705.11034 [math.CO]
Grundy PM (1939) Mathematics and games. Eureka 2:6–8
Jones GA (2005) Automorphisms and regular embeddings of merged Johnson graphs. Euro J Comb 26:417–435
Khandhawit T, Ye L (2011) Chomp on graphs and subsets. Arxiv prerpint arXiv:1101.2718 [math.CO]
Kummer E (1852) Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen. J für Die Reine und Angew Math 44:93–146
Lucas E (1878) Théorie des Fonctions Numériques Simplement Périodiques. American Journal of Mathematics 1(2): 184–196, (3):197– 240, (4):289–321
O’Sullivan C (2017) A vertex and edge deletion game on graphs. Arxiv preprint arXiv:1709.01354 [math.CO]
Schuh F (1952) Spel van delers. Nieuw Tijdschrift voor Wiskunde 39:299–304
Sprague RP (1935) Über mathematische Kampfspiele. Tohoku Math J 41:438–444
Schwalbe U, Walker P (2001) Zermelo and the early history of game theory. Games Econ Behav 34(1):123–137
Both I.G. and K.K. thank L.P.M. and Mireia Ferrer for their hospitality and the good time spent during the stay in Guanajuato. We thank Cormac O’Sullivan for pointing out an error in a theorem about almost bipartite graphs stated in an earlier version of the paper.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
L.P.M. has been supported by the Mexican National Council on Science and Technology (Cátedras-CONACYT). K.K. has been supported by ANR projects GATO: ANR-16-CE40-0009-01, DISTANCIA: ANR-17-CE40-0015, and CAPPS: ANR-17-CE40-0018. I. G. has been supported by Ministerio de Economía y Competitividad, Spain (MTM2016-78881-P). This research was initiated on a visit of I.G. and K.K. at CIMAT supported by UMI Laboratoire Solomon Leftschetz— LaSol—no. 2001 CNRS-CONACYT-UNAM, Mexique.
About this article
Cite this article
García-Marco, I., Knauer, K. & Montejano, L.P. Chomp on generalized Kneser graphs and others. Int J Game Theory (2019). https://doi.org/10.1007/s00182-019-00697-x
- Combinatorial games
- Impartial games
- Generalized Kneser graphs
- Johnson graphs
- Threshold graphs
- Clique complex
Mathematics Subject Classification