$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number

Saman Bazarghani, Paz Carmi, Vida Dujmović +1

We show that anagram-free vertex colouring a $2\times n$ square grid requires a number of colours that increases with $n$. This answers an open question in Wilson's thesis and show…