arXiv:0807.4450 Abstract | arXiv Analytics

arXiv:0807.4450 [math.CO]Abstract References Reviews Resources

Candy-passing Games on General Graphs, I

Published 2008-07-28Version 1

We undertake the first study of the candy-passing game on arbitrary connected graphs. We obtain a general stabilization result which encompasses the first author's results (arXiv:0709.2156) for candy-passing games on n-cycles with at least 3n candies.

Comments: 2 pages

Categories: math.CO, cs.DM

Subjects: 05C35, 37B15

Keywords: candy-passing game, general graphs, first authors results, general stabilization result, 3n candies

Related articles: Most relevant | Search more

arXiv:0807.4655 [math.CO] (Published 2008-07-29)

Candy-passing Games on General Graphs, II

Paul M. Kominers, Scott D. Kominers

arXiv:1302.0318 [math.CO] (Published 2013-02-01)

Critical Sets for Sudoku and General Graphs

Joshua Cooper, Anna Kirkpatrick

arXiv:2112.03893 [math.CO] (Published 2021-12-07, updated 2022-11-08)