A square-grid coloring problem

Matthew Kahle, Francisco Martinez-Figueroa, Alexander Soifer

Suppose that $n\ge 2$, and we wish to plant $k$ different types of trees in the squares of an $n\times n$ square grid. We can have as many of each type as we want. The only rule…