Colorings breaking prescribed families of graph automorphisms
Abstract
We prove that for every continuous action of a compact group on a discrete set, each finite-color template admits a coloring from arbitrary lists of the same size whose stabilizer is contained in a conjugate of the template stabilizer. Consequently, the ordinary and list parameters coincide whenever the ordinary parameter is finite. In particular, we answer the question of Ferrara, Flesch and Gethner negatively for finite graphs, and establish the finite case of the conjecture of Kwaśny and Stawiski whenever a distinguishing edge coloring exists. We also show that every closed locally compact permutation group with infinite motion on a countably infinite set admits continuum many inequivalent distinguishing colorings from arbitrary 2-element lists. Using compact kernels and finite bases, we extend ordinary and list equality to countable graphs with countable automorphism groups and prove that one additional list color suffices for connected locally finite graphs. Using this multiplicity and a construction fixing all vertices of infinite degree, we prove that D'ℓ(G)≤ 2 for every countable connected graph with infinite edge motion, settling the list infinite edge-motion conjecture of Kwaśny and Stawiski.
Related
- R-equivalence of quandle colorings and inner automorphisms
- Artin-Schreier curves of prescribed p-rank without extra automorphisms
- Sub-quorum colorings of some infinite families of caterpillars
- Sampling Line-Graph Colorings with Constant Extra Colors
- Realizing graph automorphisms as geometric symmetries of straight line drawings
BibTeX
@misc{lei2026colorings,
title = {{Colorings breaking prescribed families of graph automorphisms}},
author = {Hui Lei and Yu Wang and Yueyue Zhao},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02762},
eprint = {2611.02762},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02762},
}
RIS
TY - UNPB
TI - Colorings breaking prescribed families of graph automorphisms
AU - Hui Lei
AU - Yu Wang
AU - Yueyue Zhao
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02762
UR - https://arxiv.org/abs/2611.02762
AB - We prove that for every continuous action of a compact group on a discrete set, each finite-color template admits a coloring from arbitrary lists of the same size whose stabilizer is contained in a conjugate of the template stabilizer. Consequently, the ordinary and list parameters coincide whenever the ordinary parameter is finite. In particular, we answer the question of Ferrara, Flesch and Gethner negatively for finite graphs, and establish the finite case of the conjecture of Kwaśny and Stawiski whenever a distinguishing edge coloring exists. We also show that every closed locally compact permutation group with infinite motion on a countably infinite set admits continuum many inequivalent distinguishing colorings from arbitrary 2-element lists. Using compact kernels and finite bases, we extend ordinary and list equality to countable graphs with countable automorphism groups and prove that one additional list color suffices for connected locally finite graphs. Using this multiplicity and a construction fixing all vertices of infinite degree, we prove that D'_ℓ(G)≤ 2 for every countable connected graph with infinite edge motion, settling the list infinite edge-motion conjecture of Kwaśny and Stawiski.
ER -