Simon M. Smith

activity

20132019

most citedThe structure of primitive permutation groups with finite suborbits and t.d.l.c. groups admitting a compact open subgroup that is maximal

2 citations · 3 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2018

On symmetries of edge and vertex colourings of graphs

Florian Lehner, Simon M. Smith

Let $c$ and $c^{'}$ be edge or vertex colourings of a graph $G$ . We say that $c^{'}$ is less symmetric than $c$ if the stabiliser (in $Aut G$ ) of $c^{'}$ is contained in the…

math.CO2018

Distinguishing density and the Distinct Spheres Condition

Wilfried Imrich, Florian Lehner, Simon M. Smith

If a graph $G$ has distinguishing number 2, then there exists a partition of its vertex set into two parts, such that no nontrivial automorphism of $G$ fixes setwise the two parts.…

math.CO2013★ 1 cited

Bounding the distinguishing number of infinite graphs

Simon M. Smith, Mark E. Watkins

A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the identity permutation in G fixes setwise all of the cells…