[Paper Review] Grid designs
The paper studies G-designs where G is a grid graph (C_n × C_n or P_n × P_n), proving partitions of complete graphs into such grids for certain n and providing constructive finite-field-based designs; notably, K_16 can be partitioned into five P_4 × P_4 grids, while K_9 cannot be partitioned into three P_3 × P_3 grids.
We define a grid graph $G$ as a Cartesian product of path-graphs $P_n$ or cycle-graphs $C_n$ as shown in Figure 1, and we ask, when can the edge set of a complete graph be expressed as a disjoint union of graphs isomorphic to $G$? That is, we are asking for which grid graphs a $G$-design exists, where a $G$-design is defined as a decomposition of a complete graph into edge-disjoint subgraphs isomorphic to $G$. We show that when $n$ is an odd prime or the square of an odd prime, the toroidal grid-graph $G = C_n \square C_n$ admits a $G$-design. In the less symmetrical case of products of path-graphs, we prove that $G = P_3 \square P_3$ does not admit a $G$-design but that $G = P_4 \square P_4$ does. This last result is the special case that motivated the present paper: a $P_4 \square P_4$-design corresponds to a way of successively scrambling a Connections puzzle so that each pair of words occurs adjacently exactly once. Our constructions use the arithmetic of finite fields.
Motivation & Objective
- Define G-designs as decompositions of a complete graph into edge-disjoint subgraphs isomorphic to a grid G.
- Investigate existence of G-designs for G = C_n × C_n and G = P_n × P_n in various n, especially prime powers.
- Provide explicit constructions using finite fields for torus grids and ordinary grids.
- Highlight connections to puzzles like Connections and motivate broader questions about higher-power grids.
Proposed method
- Model vertices of complete graphs as elements of finite fields (e.g., F_p^2 or F_p^4) and ascribe adjacency via fixed difference sets to obtain subgraphs isomorphic to the target grid.
- Partition the vertex set into copies G(α,β,...) parameterized by field basis elements, ensuring each edge of K_n^2 is covered exactly once.
- Use Kotzig’s result to relate decompositions of C_p × C_p to Hamiltonian cycles in C_p × C_p, enabling stepwise construction for higher powers.
- For K_{p^2} show partition into (p^2−1)/4 copies of C_p × C_p (Theorem 1); for K_{p^4} show partition into (p^4−1)/4 copies of C_{p^2} × C_{p^2} (Theorem 2); for K_{16} construct five copies of P_4 × P_4 (Theorem 4).
Experimental results
Research questions
- RQ1For which n does K_{n^2} admit a decomposition into copies of C_n × C_n or P_n × P_n?
- RQ2Can K_{p^2} be partitioned into copies of C_p × C_p for odd primes p? (Yes, by Theorem 1)
- RQ3Can K_{p^4} be partitioned into copies of C_{p^2} × C_{p^2} for odd primes p? (Yes, by Theorem 2)
- RQ4Do small cases like K_9 and K_16 admit partitions into P_3 × P_3 and P_4 × P_4 respectively? (K_9 no for three copies; K_16 yes for five copies as shown)
- RQ5What are the open questions for higher-power grids and mixed grid types (e.g., C_m × C_n, P_m × P_n)?
Key findings
- K_{p^2} can be partitioned into (p^2−1)/4 copies of C_p × C_p for any odd prime p (Theorem 1).
- K_{p^4} can be partitioned into (p^4−1)/4 copies of C_{p^2} × C_{p^2} for any odd prime p (Theorem 2).
- K_9 cannot be partitioned into three copies of P_3 × P_3 (Theorem 3).
- K_{16} can be partitioned into five copies of P_4 × P_4 (Theorem 4).
- The constructions employ finite-field arithmetic and basis-based edge-difference schemes to realize grid-decompositions.
Read this paper
Open the full text in the Nubint reader and ask about any passage as you read.
Read this paper on NubintThis review was generated by AI from the original paper. Please check the paper before citing it.