Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.22705 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908991189155840 |
|---|---|
| author | Waite, Luke |
| author_facet | Waite, Luke |
| contents | We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and Möller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $Γ$ is periodic if the resulting coloured graph has a finite number of orbits under its colour-preserving automorphisms, as such it is natural to consider those quasi-transitive graphs with finite quotient. In the case that the graph is planar and has 1-end we prove that it always permits a periodic proper vertex colouring. This is shown by constructing isometry respecting embedded maps into the Euclidean and hyperbolic planes and leveraging known properties of Euclidean and hyperbolic isometry groups. Moreover, in the case that a graph is Euclidean we show that this can always be done in 5 colours. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_22705 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Planar 1-ended graphs can be periodically coloured Waite, Luke Combinatorics Group Theory 05C15 (Primary) 05C10, 20H15 (Secondary) We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and Möller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $Γ$ is periodic if the resulting coloured graph has a finite number of orbits under its colour-preserving automorphisms, as such it is natural to consider those quasi-transitive graphs with finite quotient. In the case that the graph is planar and has 1-end we prove that it always permits a periodic proper vertex colouring. This is shown by constructing isometry respecting embedded maps into the Euclidean and hyperbolic planes and leveraging known properties of Euclidean and hyperbolic isometry groups. Moreover, in the case that a graph is Euclidean we show that this can always be done in 5 colours. |
| title | Planar 1-ended graphs can be periodically coloured |
| topic | Combinatorics Group Theory 05C15 (Primary) 05C10, 20H15 (Secondary) |
| url | https://arxiv.org/abs/2604.22705 |