Proving the Pressing Game Conjecture on Linear Graphs

Eliot Bixby, Toby Flint, István Miklós

The pressing game on black-and-white graphs is the following: Given a graph $G(V,E)$ with its vertices colored with black and white, any black vertex $v$ can be pressed, which has…