13 citations · 53 across the 33 of their papers we have counts for
4 papers · 1 filter
An upper bound on the size of avoidance couplings
Erik Bates, Lisa Sauermann
We show that a coupling of non-colliding simple random walkers on the complete graph on vertices can include at most walkers. This improves the only previously kno…
A polynomial bound for the arithmetic -cycle removal lemma in vector spaces
Jacob Fox, László Miklós Lovász, Lisa Sauermann
For each , Green proved an arithmetic -cycle removal lemma for any abelian group . The best known bounds relating the parameters in the lemma for general are of…
Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
Jacob Fox, Lisa Sauermann
For a finite abelian group , the Erdős-Ginzburg-Ziv constant is the smallest such that every sequence of (not necessarily distinct) elements of has…
Decomposing graphs into forests
Christian Reiher, Lisa Sauermann
We give a simple graph-theoretic proof of a classical result due to C. St. J. A. Nash-Williams on covering graphs by forests. Moreover we derive a slight generalisation of this sta…