Candy-passing Games on General Graphs, I

Simple item page
dc.creatorKominers, Paul M.
dc.creatorKominers, Scott D.
dc.date2008-07-28
dc.date.accessioned2026-07-07T09:53:18Z
dc.date.available2026-07-07T09:53:18Z
dc.descriptionWe 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.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/0807.4450
dc.identifierhttp://arxiv.org/abs/0807.4450
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165906
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subject05C35 (Primary); 37B15 (Secondary)
dc.titleCandy-passing Games on General Graphs, I
dc.typetext

Files

Collections

arXiv