Candy-passing Games on General Graphs, II

Details Candy-passing Games on General Graphs, II Candy-passing Games on General Graphs, II

2008-07-29

arxiv.org/abs/0807.4655v1

Mathematics

Combinatorics

3 pages

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Candy-passing Games on General Graphs, II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Candy-passing Games on General Graphs, II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Candy-passing Games on General Graphs, II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38781