Bounding the distinguishing number of infinite graphs and permutation groups

zbMath1301.05138arXiv1302.4409MaRDI QIDQ743653

Mark E. Watkins, Simon M. Smith

Publication date: 30 September 2014

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

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

zbMATH Keywords

infinite graphdistinguishing numberimprimitive graphdistinguishing coloringimprimitive permutation groupinfinite permutation group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Infinite automorphism groups (20B27) Infinite graphs (05C63)

Related Items (5)

THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Distinguishability of infinite groups and graphs
• The distinguishing chromatic number
• Distinguishability of locally finite trees
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• The distinguishing number of the direct product and wreath product action.
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Notes on infinite permutation groups

This page was built for publication: Bounding the distinguishing number of infinite graphs and permutation groups