Evasive Random Walks and the Clairvoyant Demon

Aaron Abrams, Henry Landau, Zeph Landau +2

A pair of random walks $(R,S)$ on the vertices of a graph $G$ is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along $R$ and $S$ witho…