Candy-passing Games on General Graphs, I

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
2 pages

Keywords

Combinatorics, Discrete Mathematics, 05C35 (Primary); 37B15 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/165906

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0807.4450
 http://arxiv.org/abs/0807.4450

Collections

arXiv