Bounding the distinguishing number of infinite graphs and permutation groups
From MaRDI portal
Publication:743653
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
infinite graph; distinguishing number; imprimitive graph; distinguishing coloring; imprimitive permutation group; infinite permutation group
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C15: Coloring of graphs and hypergraphs
20B27: Infinite automorphism groups
05C63: Infinite graphs
Related Items
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH, Unnamed Item, Unnamed Item, On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture, Trees with distinguishing index equal distinguishing number plus one
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