Infinite motion and 2-distinguishability of graphs and groups

DOI10.1007/s10801-014-0529-2zbMath1307.05231arXiv1304.6436OpenAlexW1965339293MaRDI QIDQ2256057

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

Publication date: 19 February 2015

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

automorphisminfinite graphmotiondistinguishabilitydistinguishing numberinfinite permutation grouporbit-equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Infinite automorphism groups (20B27) Infinite graphs (05C63) Group actions on combinatorial structures (05E18)

Related Items (15)

Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Distinguishing graphs with intermediate growth ⋮ Breaking graph symmetries by edge colourings ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Distinguishing infinite graphs with bounded degrees ⋮ Asymmetric colouring of locally compact permutation groups ⋮ Distinguishing density and the distinct spheres condition ⋮ Improving upper bounds for the distinguishing index ⋮ Unnamed Item ⋮ Distinguishing graphs of maximum valence 3 ⋮ The distinguishing number and distinguishing chromatic number for posets ⋮ Distinguishing number of universal homogeneous Urysohn metric spaces ⋮ The distinguishing index of infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Distinguishability of infinite groups and graphs
• Distinguishing maps
• Cartesian powers of graphs can be distinguished by two labels
• Distinguishability of locally finite trees
• On groups with no regular orbits on the set of subsets
• A note on automorphism groups of countably infinite structures
• A note on the asymptotic and computational complexity of graph distinguishability
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• Distinguishing number of countable homogeneous relational structures
• Distinguishing graphs with intermediate growth
• The distinguishing number of Cartesian products of complete graphs
• Orbit-equivalent infinite permutation groups.
• The maximum distinguishing number of a group
• Distinguishing labellings of group action on vector spaces and graphs
• Automorphisms and endomorphisms of infinite locally finite graphs
• Motion and distinguishing number two
• Base size, metric dimension and other invariants of groups and graphs
• Distinguishing graphs with infinite motion and nonlinear growth
• Locally finite, planar, edge-transitive graphs
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Random Colourings and Automorphism Breaking in Locally Finite Graphs
• Local definability theory
• Distinguishing Cartesian powers of graphs

This page was built for publication: Infinite motion and 2-distinguishability of graphs and groups