No polynomial bound for the chip firing game on directed graphs
HTML articles powered by AMS MathViewer
- by Kimmo Eriksson PDF
- Proc. Amer. Math. Soc. 112 (1991), 1203-1205 Request permission
Abstract:
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.References
-
A. Björner, L. Lovász, and P. Shor, Chip-firing games on graphs, preprint, 1987.
- Gábor Tardos, Polynomial bound for a chip firing game on graphs, SIAM J. Discrete Math. 1 (1988), no. 3, 397–398. MR 955655, DOI 10.1137/0401039
Additional Information
- © Copyright 1991 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 112 (1991), 1203-1205
- MSC: Primary 90D43; Secondary 05C20
- DOI: https://doi.org/10.1090/S0002-9939-1991-1065944-3
- MathSciNet review: 1065944