Lawrence Hollom

lh569 (at) cam (dot) ac (dot) uk
CV | arXiv | Google Scholar | GitHub

Office C0.13
Centre for Mathematical Sciences
Cambridge, CB3 0WA
United Kingdom

I'm a third year PhD student at the University of Cambridge under the supervision of Professor Béla Bollobás. My research interests are Extremal, Probabilistic, and Infinitary Combinatorics.

I completed my undergraduate degree at Cambridge, and then went on to also take Part III. Between this and starting my PhD, I worked as a quantitative trader at Jane Street in London for 18 months.

Selected papers

1. A resolution of the Aharoni–Korman conjecture
   L. Hollom
   Submitted
   arXiv

2. Discrepancies of spanning trees in dense graphs
   L. Hollom, L. Lichev, A. Mond, and J. Portier
   Submitted
   arXiv

3. A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
   L. Hollom
   Submitted
   arXiv

4. Almost colour-balanced spanning forests in complete graphs
   L. Hollom, A. Mond, J. Portier
   Submitted
   arXiv

5. The bunkbed conjecture is not robust to generalisation
   L. Hollom
   Submitted
   arXiv | Quanta

6. Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem
   L. Hollom, J. Portier
   Submitted
   arXiv

Last updated January 2025