1 citations · 1 across the 4 of their papers we have counts for
5 papers
Edge Inversions in -closed Groups
Kirwin Hampshire, Florian Lehner, Andrew Wood
We construct -closed groups acting on in which all edge inversions have infinite order. This provides a negative answer to a question posed by Tornier. We also constru…
Distinguishing finite and infinite trees of arbitrary cardinality
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
Let be a finite or infinite graph and the minimum number of vertices moved by the non-identity automorphisms of . We are interested in bounds on the supremum o…
On weak cop numbers of transitive graphs
Florian Lehner
The weak cop number of infinite graphs can be seen as a coarse-geometric analogue to the cop number of finite graphs. We show that every vertex transitive graph with at least one t…
Locally finite graphs and their localization numbers
Anthony Bonato, Florian Lehner, Trent G. Marbach +1
We study the Localization game on locally finite graphs trees, where each of the countably many vertices have finite degree. In contrast to the finite case, we construct a locally…
Random colorings and automorphism breaking in locally finite graphs
Florian Lehner
A colouring of a graph G is called distinguishing if its stabiliser in Aut G is trivial. It has been conjectured that, if every automorphism of a locally finite graph moves infinit…