Candy-passing Games on General Graphs, II

Simple item page
dc.creatorKominers, Paul M.
dc.creatorKominers, Scott D.
dc.date2008-07-29
dc.date.accessioned2026-07-07T09:53:31Z
dc.date.available2026-07-07T09:53:31Z
dc.descriptionWe give a new proof that any candy-passing game on a graph G with at least 4|E(G)|-|V(G)| candies stabilizes. (This result was first proven in arXiv:0807.4450.) Unlike the prior literature on candy-passing games, we use methods from the general theory of chip-firing games which allow us to obtain a polynomial bound on the number of rounds before stabilization.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0807.4655
dc.identifierhttp://arxiv.org/abs/0807.4655
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165979
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subject05C35, 05C85, 68Q25 (Primary); 37B15, 68R10, 68Q80 (Secondary)
dc.titleCandy-passing Games on General Graphs, II
dc.typetext

Files

Collections

arXiv