Olaf Parczyk

olafparczyk@gmail.com, arXiv, Google Scholar, ORCiD

I am a mathematician. Until recently I was a research assistant at the Zuse Institute Berlin. In the winter terms 2025/26 and 2024/25 I was a substitute professor at FU-Berlin. Previously, I was a Math+ Postdoc at FU-Berlin, 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 include probabilistic and extremal combinatorics, Ramsey theory, and computational mathematics. I primarily work on graph-embedding problems, often involving randomness in one form or another.

Publications

Preprints

Published

  1. The maximum diameter of 2-dimensional simplicial complexes with Silas Rathke and Tibor Szabó, Discrete & Computational Geometry 76, 1687–1724 (2026). DOI, arXiv.
  2. An Unsure Note on an Un-Schur Problem with Christoph Spiegel, The Electronic Journal of Combinatorics 33 (2026), no 1, P1.45. DOI, arXiv.
  3. Dirac’s Theorem for Graphs of Bounded Bandwidth with Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, and Amedeo Sgueglia, The Electronic Journal of Combinatorics 33 (2026), no 1, P1.21. DOI, arXiv.
  4. Spanning Spheres in Dirac Hypergraphs with Freddie Illingworth, Richard Lang, Alp Müyesser, and Amedeo Sgueglia. Combinatorica 45, 43 (2025). DOI, arXiv.
  5. On product Schur triples in the integers with Letícia Mattos and Domenico Mergoni Cecchelli. SIAM Journal on Discrete Mathematics 39, no 2 (2025), 1082-1095. DOI, arXiv.
  6. New Ramsey Multiplicity Bounds and Search Heuristics with Sebastian Pokutta, Christoph Spiegel, and Tibor Szabó. Foundations of Computational Mathematics (2024). DOI, arXiv.
  7. Minimum degree conditions for containing an r-regular r-connected subgraph with Max Hahn-Klimroth and Yury Person. European Journal of Combinatorics, 118 (2024), 103940. DOI, arXiv.
  8. Resilience for tight Hamiltonicity with Peter Allen and Vincent Pfenninger. Combinatorial Theory, 4, no 1 (2024), #9. DOI, arXiv.
  9. The square of a Hamilton cycle in randomly perturbed graphs with Julia Böttcher, Amedeo Sgueglia, and Jozef Skokan. Random Structures & Algorithms (2024), 1–45. DOI, arXiv.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. 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.
  21. 2-universality in randomly perturbed graphs. European Journal of Combinatorics 87 (2020), 103–118. DOI, arXiv.
  22. 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.
  23. 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.
  24. Spanning structures and universality in sparse hypergraphs with Yury Person. Random Structures & Algorithms 49 (2016), no 4, 819–844. DOI, arXiv.
  25. On universal hypergraphs with Samuel Hetterich and Yury Person. The Electronic Journal of Combinatorics 23 (2016), no 4, P4.28. DOI, arXiv.

Conference Proceedings

Thesis Supervision

Master

Bachelor

Teaching

Theses