# Lisa Sauermann

I am a fifth year PhD student in the Stanford Math Department. My advisor is Jacob Fox.

My main research interests are extremal and probabilistic combinatorics.

E-mail: lsauerma [@] stanford [dot] edu

### Publications and Preprints:

- J. Fox, L. Sauermann, and F. Wei,
**On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices**, in preparation.
- J. Fox and L. Sauermann,
**A completion of the proof of the Edge-statistics Conjecture**, submitted. (arxiv)
- L. M. Lovász and L. Sauermann,
**A lower bound for the k-multicolored sum-free problem in \mathbb{Z}_m^n**, *Proceedings of the London Mathematical Society*, to appear. (arxiv)
- E. Bates and L. Sauermann,
**An upper bound on the size of avoidance couplings**, *Combinatorics, Probability and Computing*, to appear. (arxiv)
- L. Sauermann,
**A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k**, *Journal of Combinatorial Theory Series B* 134 (2019), 36-75. (arxiv)
- J. Fox, L. M. Lovász, and L. Sauermann,
**A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces**, *Journal of Combinatorial Theory Series A* 160 (2018), 186-201. (arxiv)
- J. Fox and L. Sauermann,
**Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions**, *Electronic Journal of Combinatorics* 25 (2018), no. 2, Paper 2.14, 9 pp. (arxiv)
- L. Sauermann,
**On the \mu-admissible set in the extended affine Weyl groups of E_6 and E_7**, *Journal of Algebra* 451 (2016), 526-543. (arxiv)
- C. Reiher and L. Sauermann,
**Nash-Williams' theorem on decomposing graphs into forests**, *Mathematika* 60 (2014), 32-36. (arxiv)

### Teaching:

- Fall 2016: MATH 61DM (linear algebra and its application to combinatorics).
- Spring 2016: MATH 51 (linear algebra and multi-variable calculus).
- Winter 2016: MATH 210B (commutative algebra).