Random Colourings and Automorphism Breaking in Locally Finite Graphs

DOI10.1017/S0963548313000382zbMath1282.05043arXiv1304.6642MaRDI QIDQ5397738

Florian Lehner

Publication date: 24 February 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6642

zbMATH Keywords

distinguishing colouringdistinguishing 2-colouringrandom 2-colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite automorphism groups (20B27) Infinite graphs (05C63) Group actions on combinatorial structures (05E18) Density (toughness, etc.) (05C42)

Related Items (8)

Extending precolorings to distinguish group actions ⋮ Distinguishing graphs with intermediate growth ⋮ Breaking graph symmetries by edge colourings ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Distinguishing infinite graphs with bounded degrees ⋮ Asymmetric colouring of locally compact permutation groups ⋮ Distinguishing density and the distinct spheres condition ⋮ Infinite motion and 2-distinguishability of graphs and groups

Cites Work

• Unnamed Item
• Unnamed Item
• Some remarks on the infinite symmetric groups
• A note on automorphism groups of countably infinite structures
• Automorphisms and endomorphisms of infinite locally finite graphs

This page was built for publication: Random Colourings and Automorphism Breaking in Locally Finite Graphs