Distinguishability of infinite groups and graphs

zbMath1243.05086arXiv1106.4778MaRDI QIDQ426906

Mark E. Watkins, Simon M. Smith, Thomas W. Tucker

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

primitive graphprimitive permutation groupCartesian product of graphsdistinguishing numberdistinct spheres conditioninfinite motion

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Primitive groups (20B15) Infinite automorphism groups (20B27) Infinite graphs (05C63) Graph operations (line graphs, products, etc.) (05C76)

Related Items (20)

Paint cost and the frugal distinguishing number ⋮ Distinguishing graphs with intermediate growth ⋮ Breaking graph symmetries by edge colourings ⋮ Reconstructing a minimal topological dynamical system from a set of return times ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Distinguishing orthogonality graphs ⋮ Endomorphism breaking in graphs ⋮ Distinguishing density and the distinct spheres condition ⋮ Orbit-equivalent infinite permutation groups. ⋮ Unnamed Item ⋮ Distinguishing graphs by edge-colourings ⋮ Distinguishing Cartesian products of countable graphs ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ Distinguishing graphs of maximum valence 3 ⋮ A note on computable distinguishing colorings ⋮ The cost of 2-distinguishing hypercubes ⋮ Bounding the distinguishing number of infinite graphs and permutation groups ⋮ Symmetry parameters for Mycielskian graphs ⋮ The distinguishing index of infinite graphs

This page was built for publication: Distinguishability of infinite groups and graphs