Florian Lehner

activity

20132026

most citedRandom colorings and automorphism breaking in locally finite graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Distinguishing finite and infinite trees of arbitrary cardinality

Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2

Let $G$ be a finite or infinite graph and $m (G)$ the minimum number of vertices moved by the non-identity automorphisms of $G$ . We are interested in bounds on the supremum $Δ (G)$ o…

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…