Square-free Walks on Labelled Graphs

TL;DR

This paper characterizes when infinite square-free walks exist on labelled graphs and determines the minimal colourings needed to produce such walks, revealing structural graph properties that influence these conditions.

Contribution

It provides a complete characterization of graphs that admit infinite square-free walks and computes the minimal colour number for various graph classes.

Findings

Infinite square-free G-words exist iff G has no C3, C4, C5, P5, or K_{1,3} subgraph.

The colour number γ(G) is 3 for C3, C5, P5, and 4 for C4, K_{1,3}.

All graphs with at least five vertices have γ(G) ≤ 4.

Abstract

A finite or infinite word is called a $G$-word for a labelled graph $G$ on the vertex set $A_n = \{0,1,..., n-1\}$ if $w = i_1i_2...i_k \in A_n^*$, where each factor $i_ji_{j+1}$ is an edge of $E$, i.e, $w$ represents a walk in $G$. We show that there exists a square-free infinite $G$-word if and only if $G$ has no subgraph isomorphic to one of the cycles $C_3, \ C_4, \ C_5$, the path $P_5$ or the claw $K_{1,3}$. The colour number $\gamma(G)$ of a graph $G=(A_n,E)$ is the smallest integer $k$, if it exists, for which there exists a mapping $\phi\colon A_n \to A_k$ such that $\phi(w)$ is square-free for an infinite $G$-word $w$. We show that $\gamma(G)=3$ for $G=C_3, C_5, P_5$, but $\gamma(G)=4$ for $G=C_4, K_{1,3}$. In particular, $\gamma(G) \leq 4$ for all graphs that have at least five vertices.