3 citations · 5 across the 11 of their papers we have counts for
Showing 2020 · math.COShow all
3 papers · 2 filters
math.CO2020
Self-avoiding walks and multiple context-free languages
Florian Lehner, Christian Lindorfer
Let be a quasi-transitive, locally finite, connected graph rooted at a vertex , and let be the number of self-avoiding walks of length on starting at . W…
math.CO2020
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups
Joshua Erde, Florian Lehner
A well-known conjecture of Alspach says that every -regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for in…
math.CO2020
On fixity of arc-transitive graphs
Florian Lehner, Primoz Potocnik, Pablo Spiga
The relative fixity of a permutation group is the maximum proportion of the points fixed by a non-trivial element of the group and the relative fixity of a graph is the relative fi…