Lisa Sauermann

activity

20142026

most citedCombinatorial anti-concentration inequalities, with applications

13 citations · 53 across the 33 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

3 papers · 2 filters

math.CO2017

A polynomial bound for the arithmetic $k$ -cycle removal lemma in vector spaces

Jacob Fox, László Miklós Lovász, Lisa Sauermann

For each $k \geq 3$ , Green proved an arithmetic $k$ -cycle removal lemma for any abelian group $G$ . The best known bounds relating the parameters in the lemma for general $G$ are of…

math.CO2017

Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions

Jacob Fox, Lisa Sauermann

For a finite abelian group $G$ , the Erdős-Ginzburg-Ziv constant $s (G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has…

math.CO2017★ 1 cited

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…

A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces

Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions

Decomposing graphs into forests

A polynomial bound for the arithmetic $k$ -cycle removal lemma in vector spaces