3 citations · 5 across the 9 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
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…
cs.FL2020
Comparing consecutive letter counts in multiple context-free languages
Florian Lehner, Christian Lindorfer
Context-free grammars are not able to model cross-serial dependencies in natural languages. To overcome this issue, Seki et al. introduced a generalization called -multiple cont…