activity
20122022
most citedChip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph

14 citations · 18 across the 6 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2015

Rotor-routing orbits in directed graphs and the Picard group

Lilla Tóthmérész

In [5], Holroyd, Levine, Mészáros, Peres, Propp and Wilson characterize recurrent chip-and-rotor configurations for strongly connected digraphs. However, the number of steps needed…