1 problem

For $m,n\geq 2$, let $G_{m,n}$ be the rectangular grid graph with vertex set … and edges joining $(i,j)$ to $(i+1,j)$ or $(i,j+1)$ whenever those vertices exist. For an integer $r$…