Christian Lindorfer

activity

20192026

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

The language of self-avoiding walks

Christian Lindorfer, Wolfgang Woess

Let $X = (V X, E X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E X$ is equipped with an involution…

math.CO2019

A general bridge theorem for self-avoiding walks

Christian Lindorfer

Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, a…