Olaf Parczyk

Department of Mathematics
Columbia House
London School of Economics
Houghton Street
London WC2A 2AE, UK
o.parczyk@lse.ac.uk
arXiv, Google Scholar, ORCiD

I am a visiting fellow in the Department of Mathematics of the London School of Economics and Political Science working with Peter Allen, Julia Böttcher, and Jozef Skokan. My research is funded by a fellowship of the German Research Foundation (DFG, Grant PA 3513/1-1). Previously, I was a postdoctoral researcher at TU Ilmenau. I obtained my Ph.D. at Goethe University Frankfurt am Main, where my Supervisor was Yury Person. I got my Bachelors’s and Master’s degree at FU Berlin with Tibor Szabó.

Research Interests

My research interests are probabilistic and extremal combinatorics, Ramsey theory, and graph limit theory. I am mostly working on embedding type problems for graphs and usually they involve randomness in one way or the other.

Recent Contributions

Upcoming Events

Publications

Preprints

To appear

Published

  1. The size-Ramsey number of 3-uniform tight paths with Jie Han, Yoshiharu Kohayakawa, Shoham Letzter, and Guilherme O. Mota, Advances in Combinatorics, 2021:5, 12pp. DOI, arXiv.
  2. Random perturbation of sparse graphs with Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, and Samuel Mohr, The Electronic Journal of Combinatorics (2021), no 2, P2.26. DOI, arXiv.
  3. The size-Ramsey number of powers of bounded degree trees with Sören Berger, Yoshiharu Kohayakawa, Giulia S. Maesaka, Taísa Martins, Walner Mendonça, and Guilherme O. Mota. Journal of the London Mathematical Society, (2020), 1–19. DOI, arXiv.
  4. Finding tight Hamilton cycles in random hypergraphs faster with Peter Allen, Christoph Koch, and Yury Person. Combinatorics, Probability and Computing 30 (2021), no 2, 239–257. DOI, arXiv.
  5. Embedding spanning bounded degree graphs in randomly perturbed graphs with Julia Böttcher, Richard Montgomery, and Yury Person. Mathematika 66 (2020), no 2, 422–447. DOI, arXiv.
  6. 2-universality in randomly perturbed graphs. European Journal of Combinatorics 87 (2020), 103–118. DOI, arXiv.
  7. Semi-random graph process with Omri Ben Eliezer, Dan Hefetz, Gal Kronenberg, Clara Shikelman, and Miloš Stojaković. Random Structures & Algorithms 56 (2020), no 3, 648–675. DOI, arXiv.
  8. Universality of bounded degree spanning trees in randomly perturbed graphs with Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, and Yury Person. Random Structures & Algorithms 55 (2019), no 4, 854–864. DOI, arXiv.
  9. Spanning structures and universality in sparse hypergraphs with Yury Person. Random Structures & Algorithms 49 (2016), no 4, 819–844. DOI, arXiv.
  10. On universal hypergraphs with Samuel Hetterich and Yury Person. The Electronic Journal of Combinatorics (2016), no 4, P4.28. DOI, arXiv.

Conference Proceedings

Teaching

Past Events

Talks

Theses

Created with Pandoc. Last update June 2021.