1 problem

Geometric griddability and finite-letter-graph conjecture. $X$ is geometrically griddable if and only if ${\cal G}_X$ is a class of $k$-letter graphs for some finite value of $k$.