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 colouring; distinguishing 2-colouring; random 2-colourings

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

20B27: Infinite automorphism groups

05C63: Infinite graphs

05E18: Group actions on combinatorial structures

05C42: Density (toughness, etc.)