Candy-passing Games on General Graphs, I
Combinatorics
2008-07-29 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.0807.4450,
title = {Candy-passing Games on General Graphs, I},
author = {Paul M. Kominers and Scott D. Kominers},
journal= {arXiv preprint arXiv:0807.4450},
year = {2008}
}
Comments
2 pages