Periodic colorings and orientations in infinite graphs

We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely many orbits under the action of the group of automorphisms of $G$ preserving the coloring or the orientation. When such a periodic coloring or orientation of $G$ exists, $G$ itself must be quasi-transitive and it is natural to investigate when quasi-transitive graphs have such periodic colorings or orientations. We provide examples of Cayley graphs with no periodic orientation or non-trivial coloring, and examples of quasi-transitive graphs of treewidth 2 without periodic orientation or proper coloring. On the other hand we show that every quasi-transitive graph $G$ of bounded pathwidth has a periodic proper coloring with $χ(G)$ colors and a periodic orientation. We relate these problems with techniques and questions from symbolic dynamics and distributed computing and conclude with a number of open problems.

💡 Research Summary

The paper investigates when locally finite infinite graphs admit colourings or edge‑orientations that are “periodic”, i.e. the coloured or oriented graph remains quasi‑transitive: the subgroup of automorphisms preserving the additional structure has only finitely many vertex orbits. This notion captures the idea of defining a finite pattern and extending it to the whole graph by a group action. Consequently, a graph can have a periodic structure only if it is itself quasi‑transitive.

Three central questions are posed (Problems 1.1–1.3): does every locally finite quasi‑transitive graph admit a periodic proper vertex‑colouring (using χ(G) colours); does it admit a periodic orientation; and does every planar quasi‑transitive graph admit a periodic 4‑colouring? The authors answer all three negatively in full generality, but positively for a restricted class.

Negative constructions.
The first family of counterexamples uses infinite simple groups. An infinite simple group has no proper finite‑index subgroups (Corollary 2.2). Hence any Cayley graph of such a group cannot have a non‑trivial finite‑index colour‑preserving subgroup, and therefore admits no periodic proper colouring or orientation. These Cayley graphs are 1‑ended and vertex‑transitive, providing a strong negative answer to Problems 1.1 and 1.2. The construction was originally due to Hamann and Möller and later refined by Norin and Przytycki.

A second, more elementary family works with graphs of treewidth 2. The authors build a planar, infinitely‑ended graph of treewidth 2 (in fact a perfect graph) that admits no periodic proper colouring with any finite number of colours, and likewise no periodic orientation. This yields a negative answer to Problem 1.3 as well, showing that even in the planar, low‑treewidth setting the desired periodic 4‑colouring can fail.

Positive results for bounded pathwidth.
When the graph has bounded pathwidth (equivalently, the underlying finitely generated group has finite pathwidth, i.e. is virtually ℤ), the situation changes dramatically. Such graphs admit a path‑decomposition, which can be interpreted as a one‑dimensional subshift of finite type (SFT). Using classical results from symbolic dynamics—namely that every SFT over a finite alphabet has a periodic point—the authors construct a periodic proper vertex‑colouring using exactly χ(G) colours. The same construction yields a periodic orientation. Moreover, the colour‑preserving (or orientation‑preserving) automorphism group has finite index in the full automorphism group, giving a “strongly periodic” structure.

Connections and broader context.
Section 2 reviews necessary graph‑theoretic notions (tree‑ and path‑decompositions, ends) and group‑theoretic concepts (index, normal subgroups, simple groups). Section 5 links periodic colourings to symbolic dynamics: a periodic colouring corresponds to a periodic configuration in a subshift, and strong periodicity corresponds to a finite‑index stabiliser. The paper also discusses parallels with distributed computing, where local algorithms (factors of i.i.d.) can produce colourings invariant in distribution under automorphisms, but these probabilistic constructions do not guarantee a deterministic periodic colouring.

Open problems.
The authors conclude with several directions: characterising classes of groups (or graphs) that always admit periodic colourings; understanding the gap between treewidth and pathwidth for periodicity; extending the positive results to higher dimensions or to edge‑colourings; and exploring quantitative bounds on the index of the colour‑preserving automorphism subgroup.

In summary, the work delineates a clear boundary: while periodic colourings and orientations are impossible for many highly symmetric infinite graphs (especially those arising from infinite simple groups or low‑treewidth planar graphs), they become guaranteed for graphs of bounded pathwidth, where techniques from symbolic dynamics provide explicit constructions. The paper thus bridges combinatorial graph theory, group theory, dynamical systems, and theoretical computer science, and opens a rich set of questions for future research.