No Polynomial Bound for the Chip Firing Game on Directed Graphs

Kimmo Eriksson
1991 Proceedings of the American Mathematical Society  
Tardos has proved a polynomial bound on the length of a convergent chip firing game on an undirected graph. This paper demonstrates a game with exponential growth on a directed graph.
doi:10.2307/2048674 fatcat:6ad5hxworfcrxfiyadqwwvaor4