1 problem

Wilson's conjecture. Every non-trivially unstable Rose Window graph is isomorphic to a graph in one of the families W1--W9.