Olaf Parczyk

Freie Universität Berlin
Department of Mathematics and Computer Science
Arnimallee 3
14195 Berlin
+49 30 838 71932
arXiv, Google Scholar, ORCiD

I am a Math+ Postdoc in the Combinatorics and Graph Theory Group of Tibor Szabó at FU-Berlin and associated with the Interactive Optimization and Learning Laboratory of Sebastian Pokutta at the Zuse Institute Berlin. Previously, I was a visiting fellow at the London School of Economics and Political Science funded by a fellowship of the German Research Foundation (DFG, Grant PA 3513/1-1) and a postdoctoral researcher at TU Ilmenau. I obtained my Ph.D. at Goethe University Frankfurt am Main, where my supervisor was Yury Person.

Research Interests

My research interests are probabilistic and extremal combinatorics, Ramsey theory, and machine learning. 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




  1. A general approach to transversal versions of Dirac-type theorems with Pranshu Gupta, Fabian Hamman, Alp Müyesser, and Amedeo Sgueglia, Bull. London Math. Soc. 55 (2023), 2817–2839. DOI, arXiv.
  2. Anti-Ramsey threshold of complete graphs for sparse graphs with Yoshiharu Kohayakawa, Guilherme O. Mota, and Jakob Schnitzer, Discrete Mathematics 346 (2023), no 5, 113343. DOI, arXiv.
  3. Triangles in randomly perturbed graphs with Julia Böttcher, Amedeo Sgueglia, and Jozef Skokan, Combinatorics, Probability and Computing 32 (2022), no 1, 91–121. DOI, arXiv.
  4. Near optimal sparsity-constrained group testing: improved bounds with Oliver Gebhard, Max Hahn-Klimroth, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, and Nelvin Tan, IEEE Transactions on Information Theory 68 (2022), no 5, 3253–3280. DOI, arXiv.
  5. Maker-Breaker Games on Randomly Perturbed Graphs with Dennis Clemens, Fabian Hamann, and Yannick Mogge, SIAM Journal on Discrete Mathematics 35 (2021), no 4, 2734–2748. DOI, arXiv.
  6. Anti-Ramsey threshold of cycles with Garbiel F. Barros, Bruno P. Cavalar, and Guilherme O. Mota, Discrete Applied Mathematics 323 (2022) 228-235. DOI, arXiv.
  7. 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.
  8. Random perturbation of sparse graphs with Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, and Samuel Mohr, The Electronic Journal of Combinatorics 28 (2021), no 2, P2.26. DOI, arXiv.
  9. 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 103 (2021), no 4, 1314–1332. DOI, arXiv.
  10. 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.
  11. 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.
  12. 2-universality in randomly perturbed graphs. European Journal of Combinatorics 87 (2020), 103–118. DOI, arXiv.
  13. 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.
  14. 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.
  15. Spanning structures and universality in sparse hypergraphs with Yury Person. Random Structures & Algorithms 49 (2016), no 4, 819–844. DOI, arXiv.
  16. On universal hypergraphs with Samuel Hetterich and Yury Person. The Electronic Journal of Combinatorics 23 (2016), no 4, P4.28. DOI, arXiv.

Conference Proceedings


Past Events



Created with Pandoc. Last update December 2023.