Showing math.COShow all
2 papers · 1 filter
math.CO2025
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 …
math.CO2025
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…