Olaf Parczyk

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

📬 Contact

office
Room 3035 at ZIB
e-mail
homepage
page.mi.fu-berlin.de/parczyk/

🎓 Curriculum vitae

since 2024
Postdoc Representative at MATH+
since 2024
Researcher at ZIB
since 2021
Member of MATH+
2024 to 2025
Substitute Professor at FUB
2021 to 2024
Researcher at FUB
2019 to 2021
Visiting Fellow at LSE
2018 to 2019
Researcher at TUI
2014 to 2018
Researcher at JWGU
Dec 2017
Ph.D. in Mathematics at JWGU
Nov 2014
M.Sc. in Mathematics at FUB
Feb 2013
B.Sc. in Mathematics at FUB

📝 Publications and preprints

Preprints

  1. Glock, S., Parczyk, O., Rathke, S., and SzabĂł, T. (2026). The maximum diameter of d-dimensional simplicial complexes. [arXiv]
    [BibTeX]
    @misc{2026_GlockParczykRathkeSzabo_Maximumdiametersimplicialcomplexes_2602-20890,
  archiveprefix = {arXiv},
  eprint = {2602.20890},
  arxiv = {arXiv:2602.20890},
  primaryclass = {math.CO},
  year = {2026},
  author = {Glock, Stefan and Parczyk, Olaf and Rathke, Silas and SzabĂł, Tibor},
  title = {The maximum diameter of $d$-dimensional simplicial complexes},
  date = {2026-02-24}
}
  2. Kiem, A., Parczyk, O., and Spiegel, C. (2024). Forcing Graphs to be Forcing. [arXiv]
    [BibTeX]
    @misc{2024_KiemParczykSpiegel_Forcing,
  archiveprefix = {arXiv},
  eprint = {2412.12904},
  arxiv = {arXiv:2412.12904},
  primaryclass = {math.CO},
  year = {2024},
  author = {Kiem, Aldo and Parczyk, Olaf and Spiegel, Christoph},
  title = {Forcing Graphs to be Forcing},
  date = {2024-12-17}
}
  3. Böttcher, J., Frankl, N., Mergoni Cecchelli, D., Parczyk, O., and Skokan, J. (2023). Graphs with large minimum degree and no small odd cycles are 3-colourable. [arXiv]
    [BibTeX]
    @misc{2023_BoettcherEtAl_Graphs3colourable,
  archiveprefix = {arXiv},
  eprint = {2302.01875},
  arxiv = {arXiv:2302.01875},
  primaryclass = {math.CO},
  year = {2023},
  author = {Böttcher, Julia and Frankl, Nóra and Mergoni Cecchelli, Domenico and Parczyk, Olaf and Skokan, Jozef},
  title = {Graphs with large minimum degree and no small odd cycles are $3$-colourable},
  date = {2023-02-03}
}

Conference proceedings

  1. Parczyk, O., and Spiegel, C. (2025). An Unsure Note on an Un-Schur Problem. Proceedings of the Combinatorial and Additive Number Theory Conference. [arXiv]
    [BibTeX]
    @inproceedings{2024_ParczykSpiegel_UnSchur:1,
  year = {2025},
  booktitle = {Proceedings of the Combinatorial and Additive Number Theory Conference},
  archiveprefix = {arXiv},
  eprint = {2410.22024},
  arxiv = {arXiv:2410.22024},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Spiegel, Christoph},
  title = {An Unsure Note on an Un-Schur Problem}
}
  2. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2023). Fully computer-assisted proofs in extremal combinatorics. Proceedings of the AAAI Conference on Artificial Intelligence, 37(10), 12482–12490. DOI: 10.1609/aaai.v37i10.26470 [URL] [arXiv] [code]
    [BibTeX]
    @inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:1,
  year = {2023},
  booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
  month = jun,
  volume = {37},
  number = {10},
  pages = {12482--12490},
  doi = {10.1609/aaai.v37i10.26470},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/26470},
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  arxiv = {arXiv:2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and SzabĂł, Tibor},
  title = {Fully computer-assisted proofs in extremal combinatorics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
}
  3. Parczyk, O., Pokutta, S., Spiegel, C., and SzabĂł, T. (2022, July 1). New Ramsey multiplicity bounds and search heuristics. Proceedings of the Discrete Mathematics Days. [arXiv] [code]
    [BibTeX]
    @inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:2,
  year = {2022},
  date = {2022-07-01},
  booktitle = {Proceedings of the Discrete Mathematics Days},
  month = jun,
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  arxiv = {arXiv:2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and SzabĂł, Tibor},
  title = {New Ramsey multiplicity bounds and search heuristics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
}
  4. Böttcher, J., Parczyk, O., Sgueglia, A., and Skokan, J. (2021). Cycle factors in randomly perturbed graphs. Proceedings of the Latin American Algorithms, Graphs, and Optimization Symposium, 195, 404–411. DOI: 10.1016/j.procs.2021.11.049 [arXiv]
    [BibTeX]
    @inproceedings{2021_BoettcherAmedeoJozefParczyk_CyclefactorsPerturbedgraphs,
  year = {2021},
  booktitle = {Proceedings of the Latin American Algorithms, Graphs, and Optimization Symposium},
  volume = {195},
  pages = {404--411},
  doi = {10.1016/j.procs.2021.11.049},
  archiveprefix = {arXiv},
  eprint = {2103.06136},
  arxiv = {arXiv:2103.06136},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amédeo and Skokan, Jozef},
  title = {Cycle factors in randomly perturbed graphs},
  date = {2021-03-10}
}
  5. Clemens, D., Hamann, F., Mogge, Y., and Parczyk, O. (2021). Waiter-Client Games on Randomly Perturbed Graphs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 14, 397–403. DOI: 10.1007/978-3-030-83823-2_62
    [BibTeX]
    @inproceedings{2021_DennisFabianYannickParczyk_Waiterclientgames,
  year = {2021},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {14},
  pages = {397--403},
  doi = {10.1007/978-3-030-83823-2_62},
  author = {Clemens, Dennis and Hamann, Fabian and Mogge, Yannick and Parczyk, Olaf},
  title = {Waiter-Client Games on Randomly Perturbed Graphs}
}
  6. Böttcher, J., Parczyk, O., Sgueglia, A., and Skokan, J. (2021). The Square of a Hamilton Cycle in Randomly Perturbed Graphs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 14, 644–650. DOI: 10.1007/978-3-030-83823-2_103 [arXiv]
    [BibTeX]
    @inproceedings{2024_BoettcherAmedeoJozefParczyk_Hamiltoncycleperturbation:1,
  year = {2021},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {14},
  pages = {644--650},
  doi = {10.1007/978-3-030-83823-2_103},
  archiveprefix = {arXiv},
  eprint = {2202.05215},
  arxiv = {arXiv:2202.05215},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amédeo and Skokan, Jozef},
  title = {The Square of a Hamilton Cycle in Randomly Perturbed Graphs}
}
  7. Parczyk, O. (2019). Almost spanning universality in random graphs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 88(3), 997–1002. [URL]
    [BibTeX]
    @inproceedings{2019_Parczyk_Almostspanninguniversality,
  year = {2019},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {88},
  number = {3},
  pages = {997--1002},
  url = {https://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1240/753},
  author = {Parczyk, Olaf},
  title = {Almost spanning universality in random graphs}
}
  8. Hubai, T., Král, D., Parczyk, O., and Person, Y. (2019). More non-bipartite forcing pairs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 88(3), 819–825. [URL] [arXiv]
    [BibTeX]
    @inproceedings{2019_TamasDanParczykPerson_Nonbipartiteforcing,
  year = {2019},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {88},
  number = {3},
  pages = {819--825},
  url = {https://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1279/772},
  archiveprefix = {arXiv},
  eprint = {1906.04089},
  arxiv = {arXiv:1906.04089},
  primaryclass = {math.CO},
  author = {Hubai, Tamas and KrĂĄl, Dan and Parczyk, Olaf and Person, Yury},
  title = {More non-bipartite forcing pairs},
  date = {2019-06-10}
}
  9. Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., and Parczyk, O. (2019). The size‐Ramsey number of powers of bounded degree trees. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 88(3), 451–456. [URL] [arXiv]
    [BibTeX]
    @inproceedings{2021_SrenEtAl_Sizeramseytrees:1,
  year = {2019},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {88},
  number = {3},
  pages = {451--456},
  url = {https://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281/679},
  archiveprefix = {arXiv},
  eprint = {1907.03466},
  arxiv = {arXiv:1907.03466},
  primaryclass = {math.CO},
  author = {Berger, Sören and Kohayakawa, Yoshiharu and Maesaka, Giulia S. and Martins, Taísa and Mendonça, Walner and Mota, Guilherme O. and Parczyk, Olaf},
  title = {The size‐Ramsey number of powers of bounded degree trees},
  date = {2019-07-08}
}
  10. Barros, G. F., Cavalar, B. P., Mota, G. O., and Parczyk, O. (2019). Anti-Ramsey threshold of cycles for sparse graphs. Proceedings of the Latin American Algorithms, Graphs, and Optimization Symposium, 346, 89–98. DOI: 10.1016/j.entcs.2019.08.009 [arXiv]
    [BibTeX]
    @inproceedings{2022_BarrosCavalarMotaParczyk_AntiramseythresholdCyclesSparsegraphs:1,
  year = {2019},
  booktitle = {Proceedings of the Latin American Algorithms, Graphs, and Optimization Symposium},
  volume = {346},
  pages = {89--98},
  doi = {10.1016/j.entcs.2019.08.009},
  archiveprefix = {arXiv},
  eprint = {2006.02079},
  arxiv = {arXiv:2006.02079},
  primaryclass = {math.CO},
  author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf},
  title = {Anti-Ramsey threshold of cycles for sparse graphs}
}
  11. Allen, P., Koch, C., Parczyk, O., and Person, Y. (2018). Finding Tight Hamilton Cycles in Random Hypergraphs Faster. Proceedings of the LATIN 2018: Theoretical Informatics, 10807, 28–36. DOI: 10.1007/978-3-319-77404-6_3 [arXiv]
    [BibTeX]
    @inproceedings{2021_PeterChristophParczykPerson_HamiltoncyclesHypergraphs:1,
  year = {2018},
  booktitle = {Proceedings of the LATIN 2018: Theoretical Informatics},
  volume = {10807},
  pages = {28--36},
  doi = {10.1007/978-3-319-77404-6_3},
  archiveprefix = {arXiv},
  eprint = {1710.08988},
  arxiv = {arXiv:1710.08988},
  primaryclass = {math.CO},
  author = {Allen, Peter and Koch, Christoph and Parczyk, Olaf and Person, Yury},
  title = {Finding Tight Hamilton Cycles in Random Hypergraphs Faster}
}
  12. Böttcher, J., Montgomery, R., Parczyk, O., and Person, Y. (2017). Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 61, 155–161. DOI: 10.1016/j.endm.2017.06.033 [arXiv]
    [BibTeX]
    @inproceedings{2019_BoettcherMontgomeryParczykPerson_Spanninggraphsembedding:1,
  year = {2017},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {61},
  pages = {155--161},
  doi = {10.1016/j.endm.2017.06.033},
  archiveprefix = {arXiv},
  eprint = {1802.04603},
  arxiv = {arXiv:1802.04603},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury},
  title = {Embedding spanning bounded degree subgraphs in randomly perturbed graphs}
}
  13. Parczyk, O., and Person, Y. (2015). On Spanning Structures in Random Hypergraphs. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications, 49, 611–619. DOI: 10.1016/j.endm.2015.06.083 [arXiv]
    [BibTeX]
    @inproceedings{2016_PersonParczyk_Spanninguniversality:1,
  year = {2015},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  volume = {49},
  pages = {611--619},
  doi = {10.1016/j.endm.2015.06.083},
  archiveprefix = {arXiv},
  eprint = {1504.02243},
  arxiv = {arXiv:1504.02243},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Person, Yury},
  title = {On Spanning Structures in Random Hypergraphs},
  date = {2015-04-09}
}

Full articles

  1. Espuny Díaz, A., Gupta, P., Mergoni Cecchelli, D., Parczyk, O., and Sgueglia, A. (2026). Dirac’s Theorem for Graphs of Bounded Bandwidth. Electronic Journal of Combinatorics, 33(1), P1.21. DOI: 10.37236/13474 [arXiv]
    [BibTeX]
    @article{2024_AlbertoEtAl_Diractheorembandwidth,
  year = {2026},
  journal = {Electronic Journal of Combinatorics},
  volume = {33},
  number = {1},
  pages = {P1.21},
  doi = {10.37236/13474},
  archiveprefix = {arXiv},
  eprint = {2407.05889},
  arxiv = {arXiv:2407.05889},
  primaryclass = {math.CO},
  author = {Espuny Díaz, Alberto and Gupta, Pranshu and Mergoni Cecchelli, Domenico and Parczyk, Olaf and Sgueglia, Amédeo},
  title = {Dirac's Theorem for Graphs of Bounded Bandwidth}
}
  2. Parczyk, O., and Spiegel, C. (2026). An Unsure Note on an Un-Schur Problem. Electronic Journal of Combinatorics, 33(1), P1.45. DOI: 10.37236/13554 [arXiv]
    [BibTeX]
    @article{2024_ParczykSpiegel_UnSchur,
  year = {2026},
  journal = {Electronic Journal of Combinatorics},
  volume = {33},
  number = {1},
  pages = {P1.45},
  doi = {10.37236/13554},
  archiveprefix = {arXiv},
  eprint = {2410.22024},
  arxiv = {arXiv:2410.22024},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Spiegel, Christoph},
  title = {An Unsure Note on an Un-Schur Problem}
}
  3. Parczyk, O., Rathke, S., and SzabĂł, T. (2026). The Maximum Diameter of 2-Dimensional Simplicial Complexes. Discrete & Computational Geometry. DOI: 10.1007/s00454-026-00844-8 [arXiv]
    [BibTeX]
    @article{2025_ParczykRathkeSzabo_Simplicialdiameter_2511-10144,
  year = {2026},
  journal = {Discrete & Computational Geometry},
  date = {2026-04-27},
  doi = {10.1007/s00454-026-00844-8},
  archiveprefix = {arXiv},
  eprint = {2511.10144},
  arxiv = {arXiv:2511.10144},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Rathke, Silas and SzabĂł, Tibor},
  title = {The Maximum Diameter of 2-Dimensional Simplicial Complexes}
}
  4. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2025). New Ramsey multiplicity bounds and search heuristics. Foundations of Computational Mathematics, 25(5), 1777–1814. DOI: 10.1007/s10208-024-09675-6 [URL] [arXiv] [code]
    [BibTeX]
    @article{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics,
  year = {2025},
  journal = {Foundations of Computational Mathematics},
  month = oct,
  volume = {25},
  number = {5},
  pages = {1777--1814},
  doi = {10.1007/s10208-024-09675-6},
  url = {https://links.springernature.com/f/a/pBlOvGGW_XtJVRB0Ek0UTQ~~/AABE5gA~/RgRor2QwP0SiaHR0cHM6Ly9saW5rLnNwcmluZ2VyLmNvbS8xMC4xMDA3L3MxMDIwOC0wMjQtMDk2NzUtNj91dG1fc291cmNlPXJjdF9jb25ncmF0ZW1haWx0JnV0bV9tZWRpdW09ZW1haWwmdXRtX2NhbXBhaWduPW9hXzIwMjQwODI2JnV0bV9jb250ZW50PTEwLjEwMDcvczEwMjA4LTAyNC0wOTY3NS02VwNzcGNCCmbHMN_MZj4XSYBSDnBva3V0dGFAemliLmRlWAQAAAcs},
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  arxiv = {arXiv:2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and SzabĂł, Tibor},
  title = {New Ramsey multiplicity bounds and search heuristics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
}
  5. Illingworth, F., Lang, R., MĂŒyesser, A., Parczyk, O., and Sgueglia, A. (2025). Spanning Spheres in Dirac Hypergraphs. Combinatorica, 45(4), 43. DOI: 10.1007/s00493-025-00169-9 [arXiv]
    [BibTeX]
    @article{2024_FreddieEtAl_Spanningspheresdirac,
  year = {2025},
  journal = {Combinatorica},
  month = aug,
  volume = {45},
  number = {4},
  pages = {43},
  doi = {10.1007/s00493-025-00169-9},
  archiveprefix = {arXiv},
  eprint = {2407.06275},
  arxiv = {arXiv:2407.06275},
  primaryclass = {math.CO},
  author = {Illingworth, Freddie and Lang, Richard and MĂŒyesser, Alp and Parczyk, Olaf and Sgueglia, AmĂ©deo},
  title = {Spanning Spheres in Dirac Hypergraphs}
}
  6. Mattos, L., Mergoni Cecchelli, D., and Parczyk, O. (2025). On Product Schur Triples in the Integers. SIAM Journal on Discrete Mathematics, 39(2), 1082–1095. DOI: 10.1137/24M1632875 [arXiv]
    [BibTeX]
    @article{2023_MattosDomenicoParczyk_Productschurtriples,
  year = {2025},
  journal = {SIAM Journal on Discrete Mathematics},
  volume = {39},
  number = {2},
  pages = {1082--1095},
  doi = {10.1137/24M1632875},
  archiveprefix = {arXiv},
  eprint = {2311.18796},
  arxiv = {arXiv:2311.18796},
  primaryclass = {math.CO},
  author = {Mattos, LetĂ­cia and Mergoni Cecchelli, Domenico and Parczyk, Olaf},
  title = {On Product Schur Triples in the Integers}
}
  7. Böttcher, J., Parczyk, O., Sgueglia, A., and Skokan, J. (2024). The square of a Hamilton cycle in randomly perturbed graphs. Random Structures & Algorithms, 65(2), 342–386. DOI: 10.1002/rsa.21215 [arXiv]
    [BibTeX]
    @article{2024_BoettcherAmedeoJozefParczyk_Hamiltoncycleperturbation,
  year = {2024},
  journal = {Random Structures & Algorithms},
  volume = {65},
  number = {2},
  pages = {342--386},
  doi = {10.1002/rsa.21215},
  archiveprefix = {arXiv},
  eprint = {2202.05215},
  arxiv = {arXiv:2202.05215},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amédeo and Skokan, Jozef},
  title = {The square of a Hamilton cycle in randomly perturbed graphs}
}
  8. Hahn-Klimroth, M., Parczyk, O., and Person, Y. (2024). Minimum degree conditions for containing an r-regular r-connected subgraph. European Journal of Combinatorics, 118, 103940. DOI: 10.1016/j.ejc.2024.103940 [arXiv]
    [BibTeX]
    @article{2024_HahnklimrothParczykPerson_Minimumdegreesubgraph,
  year = {2024},
  journal = {European Journal of Combinatorics},
  volume = {118},
  pages = {103940},
  doi = {10.1016/j.ejc.2024.103940},
  archiveprefix = {arXiv},
  eprint = {2108.07601},
  arxiv = {arXiv:2108.07601},
  primaryclass = {math.CO},
  author = {Hahn-Klimroth, Max and Parczyk, Olaf and Person, Yury},
  title = {Minimum degree conditions for containing an $r$-regular $r$-connected subgraph}
}
  9. Allen, P., Parczyk, O., and Pfenninger, V. (2024). Resilience for tight Hamiltonicity. Combinatorial Theory, 4(1), 9. DOI: 10.5070/C64163846 [arXiv]
    [BibTeX]
    @article{2024_PeterVincentParczyk_Resiliencehamiltonicity,
  year = {2024},
  journal = {Combinatorial Theory},
  volume = {4},
  number = {1},
  pages = {9},
  doi = {10.5070/C64163846},
  archiveprefix = {arXiv},
  eprint = {2105.04513},
  arxiv = {arXiv:2105.04513},
  primaryclass = {math.CO},
  author = {Allen, Peter and Parczyk, Olaf and Pfenninger, Vincent},
  title = {Resilience for tight Hamiltonicity}
}
  10. Böttcher, J., Parczyk, O., Sgueglia, A., and Skokan, J. (2023). Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing, 32(1), 91–121. DOI: 10.1017/S0963548322000153 [arXiv]
    [BibTeX]
    @article{2022_BoettcherAmedeoJozefParczyk_Randomgraphstriangles,
  year = {2023},
  journal = {Combinatorics, Probability and Computing},
  volume = {32},
  number = {1},
  pages = {91--121},
  doi = {10.1017/S0963548322000153},
  archiveprefix = {arXiv},
  eprint = {2011.07612},
  arxiv = {arXiv:2011.07612},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amédeo and Skokan, Jozef},
  title = {Triangles in randomly perturbed graphs}
}
  11. Gupta, P., Hamann, F., MĂŒyesser, A., Parczyk, O., and Sgueglia, A. (2023). A general approach to transversal versions of Dirac‐type theorems. Bulletin of the London Mathematical Society, 55(6), 2817–2839. DOI: 10.1112/blms.12896 [arXiv]
    [BibTeX]
    @article{2023_PranshuEtAl_Transversaldirac,
  year = {2023},
  journal = {Bulletin of the London Mathematical Society},
  volume = {55},
  number = {6},
  pages = {2817--2839},
  doi = {10.1112/blms.12896},
  archiveprefix = {arXiv},
  eprint = {2209.09289},
  arxiv = {arXiv:2209.09289},
  primaryclass = {math.CO},
  author = {Gupta, Pranshu and Hamann, Fabian and MĂŒyesser, Alp and Parczyk, Olaf and Sgueglia, AmĂ©deo},
  title = {A general approach to transversal versions of Dirac‐type theorems}
}
  12. Kohayakawa, Y., Mota, G. O., Parczyk, O., and Schnitzer, J. (2023). The anti-Ramsey threshold of complete graphs. Discrete Mathematics, 346(5), 113343. DOI: 10.1016/j.disc.2023.113343 [arXiv]
    [BibTeX]
    @article{2023_YoshiharuMotaJakobParczyk_Antiramseythreshold,
  year = {2023},
  journal = {Discrete Mathematics},
  volume = {346},
  number = {5},
  pages = {113343},
  doi = {10.1016/j.disc.2023.113343},
  archiveprefix = {arXiv},
  eprint = {1902.00306},
  arxiv = {arXiv:1902.00306},
  primaryclass = {math.CO},
  author = {Kohayakawa, Yoshiharu and Mota, Guilherme O. and Parczyk, Olaf and Schnitzer, Jakob},
  title = {The anti-Ramsey threshold of complete graphs}
}
  13. Barros, G. F., Cavalar, B. P., Mota, G. O., and Parczyk, O. (2022). Anti-Ramsey threshold of cycles for sparse graphs. Discrete Applied Mathematics, 323, 228–235. DOI: 10.1016/j.dam.2021.10.021 [arXiv]
    [BibTeX]
    @article{2022_BarrosCavalarMotaParczyk_AntiramseythresholdCyclesSparsegraphs,
  year = {2022},
  journal = {Discrete Applied Mathematics},
  volume = {323},
  pages = {228--235},
  doi = {10.1016/j.dam.2021.10.021},
  archiveprefix = {arXiv},
  eprint = {2006.02079},
  arxiv = {arXiv:2006.02079},
  primaryclass = {math.CO},
  author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf},
  title = {Anti-Ramsey threshold of cycles for sparse graphs}
}
  14. Gebhard, O., Hahn-Klimroth, M., Parczyk, O., Penschuck, M., Rolvien, M., Scarlett, J., and Tan, N. (2022). Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. IEEE Transactions on Information Theory, 68(5), 3253–3280. DOI: 10.1109/TIT.2022.3141244 [arXiv]
    [BibTeX]
    @article{2022_OliverEtAl_Sparsitygrouptesting,
  year = {2022},
  journal = {IEEE Transactions on Information Theory},
  volume = {68},
  number = {5},
  pages = {3253--3280},
  doi = {10.1109/TIT.2022.3141244},
  archiveprefix = {arXiv},
  eprint = {2004.11860},
  arxiv = {arXiv:2004.11860},
  primaryclass = {cs.DS},
  author = {Gebhard, Oliver and Hahn-Klimroth, Max and Parczyk, Olaf and Penschuck, Manuel and Rolvien, Maurice and Scarlett, Jonathan and Tan, Nelvin},
  title = {Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms}
}
  15. Clemens, D., Hamann, F., Mogge, Y., and Parczyk, O. (2021). Maker-Breaker Games on Randomly Perturbed Graphs. SIAM Journal on Discrete Mathematics, 35(4), 2723–2748. DOI: 10.1137/20M1385044 [arXiv]
    [BibTeX]
    @article{2021_DennisFabianYannickParczyk_Makerbreakergames,
  year = {2021},
  journal = {SIAM Journal on Discrete Mathematics},
  volume = {35},
  number = {4},
  pages = {2723--2748},
  doi = {10.1137/20M1385044},
  archiveprefix = {arXiv},
  eprint = {2009.14583},
  arxiv = {arXiv:2009.14583},
  primaryclass = {math.CO},
  author = {Clemens, Dennis and Hamann, Fabian and Mogge, Yannick and Parczyk, Olaf},
  title = {Maker-Breaker Games on Randomly Perturbed Graphs}
}
  16. Han, J., Kohayakawa, Y., Letzter, S., Mota, G. O., and Parczyk, O. (2021). The size-Ramsey number of 3-uniform tight paths. Advances in Combinatorics, 2021, 5. DOI: 10.19086/aic.24581 [arXiv]
    [BibTeX]
    @article{2021_JieEtAl_Sizeramseynumber,
  year = {2021},
  journal = {Advances in Combinatorics},
  volume = {2021},
  pages = {5},
  doi = {10.19086/aic.24581},
  archiveprefix = {arXiv},
  eprint = {1907.08086},
  arxiv = {arXiv:1907.08086},
  primaryclass = {math.CO},
  author = {Han, Jie and Kohayakawa, Yoshiharu and Letzter, Shoham and Mota, Guilherme O. and Parczyk, Olaf},
  title = {The size-Ramsey number of 3-uniform tight paths}
}
  17. Hahn-Klimroth, M., Maesaka, G. S., Mogge, Y., Mohr, S., and Parczyk, O. (2021). Random Perturbation of Sparse Graphs. Electronic Journal of Combinatorics, 28(2), P2.26. DOI: 10.37236/9510 [arXiv]
    [BibTeX]
    @article{2021_MaxEtAl_Randomsparsegraphs,
  year = {2021},
  journal = {Electronic Journal of Combinatorics},
  volume = {28},
  number = {2},
  pages = {P2.26},
  doi = {10.37236/9510},
  archiveprefix = {arXiv},
  eprint = {2004.04672},
  arxiv = {arXiv:2004.04672},
  primaryclass = {math.CO},
  author = {Hahn-Klimroth, Max and Maesaka, Giulia S. and Mogge, Yannick and Mohr, Samuel and Parczyk, Olaf},
  title = {Random Perturbation of Sparse Graphs}
}
  18. Allen, P., Koch, C., Parczyk, O., and Person, Y. (2021). Finding tight Hamilton cycles in random hypergraphs faster. Combinatorics, Probability and Computing, 30(2), 239–257. DOI: 10.1017/S0963548320000450 [arXiv]
    [BibTeX]
    @article{2021_PeterChristophParczykPerson_HamiltoncyclesHypergraphs,
  year = {2021},
  journal = {Combinatorics, Probability and Computing},
  volume = {30},
  number = {2},
  pages = {239--257},
  doi = {10.1017/S0963548320000450},
  archiveprefix = {arXiv},
  eprint = {1710.08988},
  arxiv = {arXiv:1710.08988},
  primaryclass = {math.CO},
  author = {Allen, Peter and Koch, Christoph and Parczyk, Olaf and Person, Yury},
  title = {Finding tight Hamilton cycles in random hypergraphs faster}
}
  19. Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., and Parczyk, O. (2021). The size‐Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, 103(4), 1314–1332. DOI: 10.1112/jlms.12408 [arXiv]
    [BibTeX]
    @article{2021_SrenEtAl_Sizeramseytrees,
  year = {2021},
  journal = {Journal of the London Mathematical Society},
  volume = {103},
  number = {4},
  pages = {1314--1332},
  doi = {10.1112/jlms.12408},
  archiveprefix = {arXiv},
  eprint = {1907.03466},
  arxiv = {arXiv:1907.03466},
  primaryclass = {math.CO},
  author = {Berger, Sören and Kohayakawa, Yoshiharu and Maesaka, Giulia S. and Martins, Taísa and Mendonça, Walner and Mota, Guilherme O. and Parczyk, Olaf},
  title = {The size‐Ramsey number of powers of bounded degree trees}
}
  20. Böttcher, J., Montgomery, R., Parczyk, O., and Person, Y. (2020). Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Mathematika, 66(2), 422–447. DOI: 10.1112/mtk.12005 [URL] [arXiv]
    [BibTeX]
    @article{2019_BoettcherMontgomeryParczykPerson_Spanninggraphsembedding,
  year = {2020},
  journal = {Mathematika},
  date = {2020-04-02},
  volume = {66},
  number = {2},
  pages = {422--447},
  doi = {10.1112/mtk.12005},
  url = {https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/mtk.12005},
  archiveprefix = {arXiv},
  eprint = {1802.04603},
  arxiv = {arXiv:1802.04603},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury},
  title = {Embedding spanning bounded degree subgraphs in randomly perturbed graphs}
}
  21. Ben-Eliezer, O., Hefetz, D., Kronenberg, G., Parczyk, O., Shikhelman, C., and Stojaković, M. (2020). Semi‐random graph process. Random Structures & Algorithms, 56(3), 648–675. DOI: 10.1002/rsa.20887 [arXiv]
    [BibTeX]
    @article{2020_BeneliezerHefetzKronenbergParczykShikhelmanStojakovic_Semirandomgraph,
  year = {2020},
  journal = {Random Structures & Algorithms},
  volume = {56},
  number = {3},
  pages = {648--675},
  doi = {10.1002/rsa.20887},
  archiveprefix = {arXiv},
  eprint = {1805.02259},
  arxiv = {arXiv:1805.02259},
  primaryclass = {math.CO},
  author = {Ben-Eliezer, Omri and Hefetz, Dan and Kronenberg, Gal and Parczyk, Olaf and Shikhelman, Clara and Stojaković, Miloơ},
  title = {Semi‐random graph process}
}
  22. Parczyk, O. (2020). 2-universality in randomly perturbed graphs. European Journal of Combinatorics, 87, 103118. DOI: 10.1016/j.ejc.2020.103118 [arXiv]
    [BibTeX]
    @article{2020_Parczyk_2universalityRandomlyperturbedgraphs,
  year = {2020},
  journal = {European Journal of Combinatorics},
  volume = {87},
  pages = {103118},
  doi = {10.1016/j.ejc.2020.103118},
  archiveprefix = {arXiv},
  eprint = {1902.01823},
  arxiv = {arXiv:1902.01823},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf},
  title = {2-universality in randomly perturbed graphs}
}
  23. Böttcher, J., Han, J., Kohayakawa, Y., Montgomery, R., Parczyk, O., and Person, Y. (2019). Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, 55(4), 854–864. DOI: 10.1002/rsa.20850 [arXiv]
    [BibTeX]
    @article{2019_BoettcherEtAl_Boundeddegreespanningtrees,
  year = {2019},
  journal = {Random Structures & Algorithms},
  volume = {55},
  number = {4},
  pages = {854--864},
  doi = {10.1002/rsa.20850},
  archiveprefix = {arXiv},
  eprint = {1802.04707},
  arxiv = {arXiv:1802.04707},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Han, Jie and Kohayakawa, Yoshiharu and Montgomery, Richard and Parczyk, Olaf and Person, Yury},
  title = {Universality for bounded degree spanning trees in randomly perturbed graphs}
}
  24. Parczyk, O., and Person, Y. (2016). Spanning structures and universality in sparse hypergraphs. Random Structures & Algorithms, 49(4), 819–844. DOI: 10.1002/rsa.20690 [arXiv]
    [BibTeX]
    @article{2016_PersonParczyk_Spanninguniversality,
  year = {2016},
  journal = {Random Structures & Algorithms},
  volume = {49},
  number = {4},
  pages = {819--844},
  doi = {10.1002/rsa.20690},
  archiveprefix = {arXiv},
  eprint = {1504.02243},
  arxiv = {arXiv:1504.02243},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Person, Yury},
  title = {Spanning structures and universality in sparse hypergraphs}
}
  25. Hetterich, S., Parczyk, O., and Person, Y. (2016). On Universal Hypergraphs. Electronic Journal of Combinatorics, 23(4), P4.28. DOI: 10.37236/5562 [arXiv]
    [BibTeX]
    @article{2016_SamuelPersonParczyk_Universalhypergraphs,
  year = {2016},
  journal = {Electronic Journal of Combinatorics},
  volume = {23},
  number = {4},
  pages = {P4.28},
  doi = {10.37236/5562},
  archiveprefix = {arXiv},
  eprint = {1509.03983},
  arxiv = {arXiv:1509.03983},
  primaryclass = {math.CO},
  author = {Hetterich, Samuel and Parczyk, Olaf and Person, Yury},
  title = {On Universal Hypergraphs}
}

🔬 Projects

LESC MATH+ EF1-12
Learning Extremal Structures in Combinatorics

Extremal Combinatorics focuses on the maximum or minimum sizes of discrete structures with specific properties, posing significant challenges due to their complexity. Traditional computational approaches often fail due to exponential growth in search spaces, but recent AI advancements, especially in Reinforcement Learning, offer new potential. Applying these AI methods could provide insights into combinatorial problems while also enhancing the understanding of AI techniques in complex, sparse reward environments.

LESC MATH+ EF1-12
Jan 2021 to May 2024
4
18

💬 Talks and posters

Conference and workshop talks

Jun 2023
New Ramsey Multiplicity Bounds and Search Heuristics by Olaf Parczyk
FoCM 2023: Graph Theory and Combinatorics (FoCM), Paris
May 2023
Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-Colourable by Olaf Parczyk
Berlin-PoznaƄ-Hamburg-Warsaw Seminar, Hamburg
Sep 2022
New Ramsey Multiplicity Bounds and Search Heuristics by Olaf Parczyk
DMV Annual Meeting, Berlin
Aug 2022
New Ramsey Multiplicity Bounds and Search Heuristics by Olaf Parczyk
20th RS&A Conference, Gniezno
Jun 2022
New Ramsey Multiplicity Bounds and Search Heuristics by Olaf Parczyk
Third Southwestern German Workshop on Graph Theory, Heidelberg
Sep 2021
The Square of a Hamilton Cycle in Randomly Perturbed Graphs by Olaf Parczyk
Berlin-PoznaƄ-Hamburg-Warsaw Seminar, Będlewo
Jul 2021
Spanning Subgraphs in Randomly Perturbed Graphs by Olaf Parczyk
Mini-Symposium Extremal Combinatorics at BCC 2021 (BCC 2021), Durham
Sep 2020
Factors in Randomly Perturbed Graphs by Olaf Parczyk
DMV 2020 Conference, Chemnitz
Sep 2019
The Size-Ramsey Number of Tight 3-Uniform Paths by Olaf Parczyk
C&C 2019, NovĂœ Smokovec
Aug 2019
Almost Spanning Universality in Random Graphs by Olaf Parczyk
10th EUROCOMB Conference, Bratislava
Aug 2019
More Non-Bipartite Forcing Pairs by Olaf Parczyk
10th EUROCOMB Conference, Bratislava
Jul 2019
Universality in Randomly Perturbed Graphs by Olaf Parczyk
19th RS&A Conference, ZĂŒrich
Nov 2018
Universality in Randomly Perturbed Graphs by Olaf Parczyk
37th Kolloquium ĂŒber Kombinatorik (KolKom), Paderborn
Aug 2018
Randomly Perturbed Graphs by Olaf Parczyk
First Southwestern German Workshop on Graph Theory, Karlsruhe
Jul 2018
Randomly Perturbed Graphs by Olaf Parczyk
Large Networks and Random Graphs Workshop in Frankfurt, Frankfurt
Aug 2017
Embedding Spanning Bounded Degree Subgraphs in Randomly Perturbed Graphs by Olaf Parczyk
9th EUROCOMB Conference, Wien
Aug 2017
Finding Tight Hamilton Cycles in Hypergraphs Faster by Olaf Parczyk
18th RS&A Conference, Gniezno
Sep 2016
Explicit Construction of Universal Hypergraphs by Olaf Parczyk
6th Polish Combinatorial Conference (PCC), Będlewo
Nov 2015
Universality in Random and Sparse Hypergraphs by Olaf Parczyk
34th Kolloquium ĂŒber Kombinatorik (KolKom), Ilmenau
Sep 2015
On Spanning Structures in Random Hypergraphs by Olaf Parczyk
8th EUROCOMB Conference, Bergen
Jul 2015
Spanning Structures and Universality in Sparse Random Hypergraphs by Olaf Parczyk
17th RS&A Conference, Pittsburgh

Research seminar talks

Feb 2024
Maximal Diameter of Simplicial D-Complexes by Olaf Parczyk
Seminar on Combinatorics, Games and Optimisation, London
Nov 2023
New Ramsey Multiplicity Bounds and Search Heuristics by Olaf Parczyk
Seminar on Discrete Mathematics at Adam Mickiewicz University, PoznaƄ
Oct 2022
A General Approach to Transversal Versions of Dirac-Type Theorems by Olaf Parczyk
Research Seminar Large Networks and Random Graphs, Ilmenau
Jun 2021
Resilience for Tight Hamilton Cycles in Random Hypergraphs by Olaf Parczyk
Research Seminar Combinatorics, Berlin
Mar 2021
Between Probabilistic and Extremal Graph Theory by Olaf Parczyk
Algorithm Engineering Group Research Seminar at Hasso-Plattner-Institut, Potsdam
Feb 2021
Resilience for Tight Hamilton Cycles in Random Hypergraphs by Olaf Parczyk
Research Seminar Large Networks and Random Graphs, Ilmenau
Dec 2020
Resilience for Tight Hamilton Cycles in Random Hypergraphs by Olaf Parczyk
Graz Combinatorics and Optimization Seminar, Graz
Feb 2020
The Size-Ramsey Number of Tight 3-Uniform Paths by Olaf Parczyk
Research Seminar at Warwick University, Warwick
Dec 2019
The Size-Ramsey Number of Tight 3-Uniform Paths by Olaf Parczyk
Research Seminar Combinatorics, Berlin
Nov 2019
The Size-Ramsey Number of Tight 3-Uniform Paths by Olaf Parczyk
Seminar on Combinatorics, Games and Optimisation, London
Jun 2019
The Size-Ramsey Number of Tight 3-Uniform Paths by Olaf Parczyk
Forschungsseminar Diskrete Mathematik und Algebra, Ilmenau
Apr 2019
The Size-Ramsey Number of Powers of Bounded Degree Trees by Olaf Parczyk
Forschungsseminar Diskrete Mathematik und Algebra, Ilmenau
Feb 2018
Randomly Perturbed Graphs by Olaf Parczyk
Seminar on Combinatorics, Games and Optimisation, London
Jan 2018
Randomly Perturbed Graphs by Olaf Parczyk
Mittagsseminar at ETH ZĂŒrich, ZĂŒrich
Jun 2017
Embedding Spanning Bounded Degree Subgraphs in Randomly Perturbed Graphs by Olaf Parczyk
Combinatorics Seminar at the University of Warwick, Warwick
Mar 2017
Explicit Construction of Universal Hypergraphs by Olaf Parczyk
Seminar on Combinatorics, Games and Optimisation, London
Feb 2017
Universality in Random and Sparse Hypergraphs by Olaf Parczyk
Extremal Graph Theory Seminar at The Czech Academy of Sciences, Prague
Jan 2016
Universality in Random and Sparse Hypergraphs by Olaf Parczyk
Seminar on Combinatorics at USP, SĂŁo Paulo
Nov 2015
Universality in Random and Sparse Hypergraphs by Olaf Parczyk
Research Seminar Combinatorics, Berlin
May 2015
Spanning Structures and Universality in Sparse Random Hypergraphs by Olaf Parczyk
Kolloquium Mathematische Informatik at Goethe University Frankfurt, Frankfurt am Main
Dec 2014
On Sidorenko's Conjecture by Olaf Parczyk
AG & Oberseminar Diskrete Mathematik, Frankfurt
Nov 2014
Relative Entropy and Sidorenko's Conjecture by Olaf Parczyk
Research Seminar Combinatorics, Berlin
May 2014
On the Logarithmic Calculus and Sidorenko's Conjecture by Olaf Parczyk
Research Seminar Combinatorics, Berlin

📅 Event Attendance

Sep 2025
Open Problems in Combinatorics and Graph Theory, ZamĂĄrdi
Aug 2025
22nd RS&A Conference, Vienna
Oct 2024
Symposium Diskrete Mathematik, Berlin
Aug 2023
18th RS&A Conference, Gniezno
Jun 2023
FoCM 2023: Graph Theory and Combinatorics (FoCM), Paris
May 2023
Berlin-PoznaƄ-Hamburg-Warsaw Seminar, Hamburg
Sep 2022
DMV Annual Meeting, Berlin
Aug 2022
20th RS&A Conference, Gniezno
Sep 2021
Berlin-PoznaƄ-Hamburg-Warsaw Seminar, Będlewo
Aug 2019
10th EUROCOMB Conference, Bratislava
Jan 2019
19th RS&A Conference, ZĂŒrich
Aug 2017
9th EUROCOMB Conference, Wien
Sep 2016
6th Polish Combinatorial Conference (PCC), Będlewo
Aug 2015
8th EUROCOMB Conference, Bergen
Jul 2015
17th RS&A Conference, Pittsburgh
Jun 2022
Third Southwestern German Workshop on Graph Theory, Heidelberg
Aug 2018
First Southwestern German Workshop on Graph Theory, Karlsruhe

đŸ§‘â€đŸ« Teaching

winter 2024
Lecturer for Probability and Statistics at FUB
winter 2024
Lecturer for Discovering Mathematics I at FUB
winter 2023
Lecturer for Discrete Mathematics II - Extremal Combinatorics at FUB
summer 2023
Instructor for Seminar on Advances in Extremal Combinatorics at FUB
winter 2022
Instructor for Seminar on Random Graphs at FUB
summer 2022
Assistant for Discrete Mathematics I at FUB
summer 2022
Instructor for Seminar on Advances in Extremal Combinatorics at FUB
winter 2021
Instructor for Seminar on the Caccetta-HĂ€ggkvist Conjecture at FUB
summer 2021
Lecturer for Proinformatik I: Logic and discrete mathematics at FUB
autumn 2020
Lecturer for Graph theory at LTCC
summer 2019
Assistant for Calculus II at TUI
winter 2018
Lecturer for Discrete Mathematics at TUI
winter 2018
Assistant for Calculus I at TUI
summer 2017
Assistant for Discrete Mathematics at JWGU
winter 2016
Assistant for Optimisation at JWGU
summer 2014
Tutor for Discrete Mathematics I at FUB
winter 2013
Tutor for Stochastic I at FUB
summer 2013
Tutor for Mathematics for Computer-Scientists II at FUB
winter 2012
Tutor for Mathematics for Computer-Scientists III at FUB
winter 2012
Tutor for Mathematics for Computer-Scientists I at FUB
summer 2012
Tutor for Mathematics for Computer-Scientists II at FUB
winter 2011
Tutor for Mathematics for Computer-Scientists I at FUB
summer 2011
Tutor for Mathematics for Physicists at FUB

📝 Organization and outreach

May 2024
Organization of the BPHW Seminar in Discrete Mathematics 2024 in Berlin
May 2024
Talk at the 27. Berliner Tag der Mathematik for school children
Sep 2023
Organization of a Minisymposium on Extremal and Probabilistic Combinatorics at the DMV Annual Meeting in Ilmenau
Nov 2022
Assisted in the organization of the Festkolloquium for Martin Aigner in Berlin
Sep 2022
Organization of a Minisymposium on Extremal and Probabilistic Combinatorics at the DMV Annual Meeting in Berlin
Jun 2022
Organization of an event at the Long Night of Science in Berlin
May 2022
Organization of a Girls’ Day science outreach event in Berlin
May 2019
Organization of an escape room for the Long Night of Technology in Ilmenau