Showing math.COShow all
2 papers · 1 filter
math.CO2024
Self-avoiding walk is ballistic on graphs with more than one end
Florian Lehner, Christian Lindorfer, Christoforos Panagiotis
We prove that on any transitive graph with infinitely many ends, a self-avoiding walk of length is ballistic with extremely high probability, in the sense that there exist…
math.CO2023
Catching a robber on a random -uniform hypergraph
Joshua Erde, Mihyun Kang, Florian Lehner +2
The game of \emph{Cops and Robber} is usually played on a graph, where a group of cops attempt to catch a robber moving along the edges of the graph. The \emph{cop number} of a gra…