14 citations · 39 across the 17 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2020
The devil's staircase for chip-firing on random graphs and on graphons
Viktor Kiss, Lionel Levine, Lilla Tóthmérész
We study the behavior of the activity of the parallel chip-firing upon increasing the number of chips on an Erdős--Rényi random graph. We show that in various situations the result…
math.CO2015★ 7 cited
On the complexity of the chip-firing reachability problem
Bálint Hujter, Viktor Kiss, Lilla Tóthmérész
In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial t…