Grid designs
This paper investigates the existence of -designs (decompositions of complete graphs into edge-disjoint copies of a grid graph ), proving that such designs exist for toroidal grids when is an odd prime or its square, and for the path-grid (which relates to scrambling Connections puzzles), while showing that admits no such design.