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: parczyk (at) zib.de
parczyk (at) mi.fu-berlin.de
homepage: page.mi.fu-berlin.de/parczyk/

🎓 Curriculum vitae

since 2024: Postdoc Representative at MATH+
since 2024: Substitute Professor at FUB
since 2024: Researcher at ZIB
since 2021: Member of MATH+

View More / Less

2019 to 2021: Visiting Fellow at LSE
2018 to 2019: Researcher at TU Ilmenau
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

Parczyk, O., and Spiegel, C. (2024). An Unsure Note on an Un-Schur Problem. [arXiv]

[BibTeX]

@misc{2024_ParczykSpiegel_UnSchur,
  archiveprefix = {arXiv},
  eprint = {2410.22024},
  primaryclass = {math.CO},
  year = {2024},
  author = {Parczyk, Olaf and Spiegel, Christoph},
  title = {An Unsure Note on an Un-Schur Problem}
}

Böttcher, J., Frankl, N., Cecchelli, D. M., Skokan, J., and Parczyk, O. Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable. [arXiv]

[BibTeX]

@misc{2023_BoettcherEtAl_Graphs3colourable,
  archiveprefix = {arXiv},
  eprint = {2302.01875},
  author = {Böttcher, Julia and Frankl, Nóra and Cecchelli, Domenico Mergoni and Skokan, Jozef and Parczyk, Olaf},
  title = {Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable}
}

Mattos, L., Cecchelli, D. M., and Parczyk, O. On Product Schur Triples in the Integers. [arXiv]

[BibTeX]

@misc{2023_MattosDomenicoParczyk_Productschurtriples,
  archiveprefix = {arXiv},
  eprint = {2311.18796},
  author = {Mattos, Letícia and Cecchelli, Domenico Mergoni and Parczyk, Olaf},
  title = {On Product Schur Triples in the Integers}
}

Díaz, A. E., Gupta, P., Cecchelli, D. M., Parczyk, O., and Sgueglia, A. Dirac’s Theorem for Graphs of Bounded Bandwidth. [arXiv]

[BibTeX]

@misc{2024_AlbertoEtAl_Diractheorembandwidth,
  archiveprefix = {arXiv},
  eprint = {2407.05889},
  author = {Díaz, Alberto Espuny and Gupta, Pranshu and Cecchelli, Domenico Mergoni and Parczyk, Olaf and Sgueglia, Amedeo},
  title = {Dirac's Theorem for Graphs of Bounded Bandwidth}
}

Illingworth, F., Lang, R., Müyesser, A., Parczyk, O., and Sgueglia, A. Spanning Spheres in Dirac Hypergraphs. [arXiv]

[BibTeX]

@misc{2024_FreddieEtAl_Spanningspheresdirac,
  archiveprefix = {arXiv},
  eprint = {2407.06275},
  author = {Illingworth, Freddie and Lang, Richard and Müyesser, Alp and Parczyk, Olaf and Sgueglia, Amedeo},
  title = {Spanning Spheres in Dirac Hypergraphs}
}

Conference proceedings

Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2023). Fully Computer-assisted Proofs in Extremal Combinatorics. Proceedings of AAAI Conference on Artificial Intelligence. DOI: 10.1609/aaai.v37i10.26470 [URL] [arXiv] [code]

[BibTeX]

@inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:1,
  year = {2023},
  booktitle = {Proceedings of AAAI Conference on Artificial Intelligence},
  doi = {10.1609/aaai.v37i10.26470},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/26470},
  archiveprefix = {arXiv},
  eprint = {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}
}

Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2022). New Ramsey Multiplicity Bounds and Search Heuristics. Proceedings of Discrete Mathematics Days. [arXiv] [code]

[BibTeX]

@inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:2,
  year = {2022},
  booktitle = {Proceedings of Discrete Mathematics Days},
  archiveprefix = {arXiv},
  eprint = {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}
}

Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2021). Cycle Factors in Randomly Perturbed Graphs. Proceedings of LAGOS 2021, 195, 404–411. DOI: 10.1016/j.procs.2021.11.049

[BibTeX]

@inproceedings{2021_BoettcherAmedeoJozefParczyk_CyclefactorsPerturbedgraphs,
  year = {2021},
  booktitle = {Proceedings of LAGOS 2021},
  volume = {195},
  pages = {404-411},
  doi = {10.1016/j.procs.2021.11.049},
  author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
  title = {Cycle Factors in Randomly Perturbed Graphs}
}

Clemens, D., Hamann, F., Mogge, Y., and Parczyk, O. (2021). Waiter-Client Games on Randomly Perturbed Graphs. Proceedings of 11th EuroComb Conference, 14, 397–403. DOI: 10.1007/978-3-030-83823-2_62

[BibTeX]

@inproceedings{2021_DennisFabianYannickParczyk_Waiterclientgames,
  year = {2021},
  booktitle = {Proceedings of 11th EuroComb Conference},
  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}
}

Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2021). The Square of a Hamilton Cycle in Randomly Perturbed Graphs. Proceedings of 11th EuroComb Conference, 14, 644–650. DOI: 10.1007/978-3-030-83823-2_103 [arXiv]

[BibTeX]

@inproceedings{2024_BoettcherAmedeoJozefParczyk_Hamiltoncycleperturbation:1,
  year = {2021},
  booktitle = {Proceedings of 11th EuroComb Conference},
  volume = {14},
  pages = {644-650},
  doi = {10.1007/978-3-030-83823-2_103},
  archiveprefix = {arXiv},
  eprint = {2202.05215},
  author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
  title = {The Square of a Hamilton Cycle in Randomly Perturbed Graphs}
}

Parczyk, O. (2019). Almost Spanning Universality in Random Graphs. Proceedings of 10th EuroComb Conference, 88(3), 997–1002. [URL]

[BibTeX]

@inproceedings{2019_Parczyk_Almostspanninguniversality,
  year = {2019},
  booktitle = {Proceedings of 10th EuroComb Conference},
  volume = {88},
  number = {3},
  pages = {997-1002},
  url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1240/753},
  author = {Parczyk, Olaf},
  title = {Almost Spanning Universality in Random Graphs}
}

Hubai, T., Král, D., Person, Y., and Parczyk, O. (2019). More Non-bipartite Forcing Pairs. Proceedings of 10th EuroComb Conference, 88(3), 819–825. [URL] [arXiv]

[BibTeX]

@inproceedings{2019_TamasDanPersonParczyk_Nonbipartiteforcing,
  year = {2019},
  booktitle = {Proceedings of 10th EuroComb Conference},
  volume = {88},
  number = {3},
  pages = {819-825},
  url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1279/772},
  archiveprefix = {arXiv},
  eprint = {1906.04089},
  author = {Hubai, Tamas and Král, Dan and Person, Yury and Parczyk, Olaf},
  title = {More Non-bipartite Forcing Pairs}
}

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 10th EuroComb Conference, 88(3), 451–456. [URL] [arXiv]

[BibTeX]

@inproceedings{2021_SrenEtAl_Sizeramseytrees:1,
  year = {2019},
  booktitle = {Proceedings of 10th EuroComb Conference},
  volume = {88},
  number = {3},
  pages = {451-456},
  url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281/679},
  archiveprefix = {arXiv},
  eprint = {1907.03466},
  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}
}

Barros, G. F., Cavalar, B. P., Mota, G. O., and Parczyk, O. (2019). Anti-Ramsey Threshold of Cycles for Sparse Graphs. Proceedings of LAGOS 2019, 346, 89–98. DOI: 10.1016/j.entcs.2019.08.009 [arXiv]

[BibTeX]

@inproceedings{2022_BarrosCavalarMotaParczyk_AntiramseythresholdCyclesSparsegraphs:1,
  year = {2019},
  booktitle = {Proceedings of LAGOS 2019},
  volume = {346},
  pages = {89-98},
  doi = {10.1016/j.entcs.2019.08.009},
  archiveprefix = {arXiv},
  eprint = {2006.02079},
  author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf},
  title = {Anti-Ramsey Threshold of Cycles for Sparse Graphs}
}

Böttcher, J., Montgomery, R., Parczyk, O., and Person, Y. (2017). Embedding Spanning Bounded Degree Graphs in Randomly Perturbed Graphs. Proceedings of 9th EuroComb Conference, 61, 155–161. DOI: 10.1016/j.endm.2017.06.033 [arXiv]

[BibTeX]

@inproceedings{2019_BoettcherMontgomeryParczykPerson_Spanninggraphsembedding:1,
  year = {2017},
  booktitle = {Proceedings of 9th EuroComb Conference},
  volume = {61},
  pages = {155-161},
  doi = {10.1016/j.endm.2017.06.033},
  archiveprefix = {arXiv},
  eprint = {1802.04603},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury},
  title = {Embedding Spanning Bounded Degree Graphs in Randomly Perturbed Graphs}
}

Person, Y., and Parczyk, O. (2015). Spanning Structures and Universality in Sparse Hypergraphs. Proceedings of 8th Eurocomb Conference, 49, 611–619. DOI: 10.1016/j.endm.2015.06.083 [arXiv]

[BibTeX]

@inproceedings{2016_PersonParczyk_Spanninguniversality:1,
  year = {2015},
  booktitle = {Proceedings of 8th Eurocomb Conference},
  volume = {49},
  pages = {611-619},
  doi = {10.1016/j.endm.2015.06.083},
  archiveprefix = {arXiv},
  eprint = {1504.02243},
  author = {Person, Yury and Parczyk, Olaf},
  title = {Spanning Structures and Universality in Sparse Hypergraphs}
}

Full articles

Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2024). New Ramsey Multiplicity Bounds and Search Heuristics. Foundations of Computational Mathematics. DOI: 10.1007/s10208-024-09675-6 [arXiv] [code]

[BibTeX]

@article{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics,
  year = {2024},
  journal = {Foundations of Computational Mathematics},
  doi = {10.1007/s10208-024-09675-6},
  archiveprefix = {arXiv},
  eprint = {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}
}

Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2024). The Square of a Hamilton Cycle in Randomly Perturbed Graphs. Random Structures & Algorithms, 65(2), 342–368. DOI: 10.1002/rsa.21215 [arXiv]

[BibTeX]

@article{2024_BoettcherAmedeoJozefParczyk_Hamiltoncycleperturbation,
  year = {2024},
  journal = {Random Structures & Algorithms},
  volume = {65},
  number = {2},
  pages = {342-368},
  doi = {10.1002/rsa.21215},
  archiveprefix = {arXiv},
  eprint = {2202.05215},
  author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
  title = {The Square of a Hamilton Cycle in Randomly Perturbed Graphs}
}

Hahn-Klimroth, M., Person, Y., and Parczyk, O. (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_MaxPersonParczyk_Minimumdegreesubgraph,
  year = {2024},
  journal = {European Journal of Combinatorics},
  volume = {118},
  pages = {103940},
  doi = {10.1016/j.ejc.2024.103940},
  archiveprefix = {arXiv},
  eprint = {2108.07601},
  author = {Hahn-Klimroth, Max and Person, Yury and Parczyk, Olaf},
  title = {Minimum Degree Conditions for Containing an R-regular R-connected Subgraph}
}

Allen, P., Pfenninger, V., and Parczyk, O. (2024). Resilience for Tight Hamiltonicity. Combinatorial Theory, 4, #9. DOI: 10.5070/C64163846 [arXiv]

[BibTeX]

@article{2024_PeterVincentParczyk_Resiliencehamiltonicity,
  year = {2024},
  journal = {Combinatorial Theory},
  volume = {4},
  pages = {#9},
  doi = {10.5070/C64163846},
  archiveprefix = {arXiv},
  eprint = {2105.04513},
  author = {Allen, Peter and Pfenninger, Vincent and Parczyk, Olaf},
  title = {Resilience for Tight Hamiltonicity}
}

Gupta, P., Hamann, F., Müyesser, A., Sgueglia, A., and Parczyk, O. (2023). A General Approach to Transversal Versions of Dirac-type Theorems. Bulletin of the London Mathematical Society, 55, 2817–2839. DOI: 10.1112/blms.12896 [arXiv]

[BibTeX]

@article{2023_PranshuEtAl_Transversaldirac,
  year = {2023},
  journal = {Bulletin of the London Mathematical Society},
  volume = {55},
  pages = {2817-2839},
  doi = {10.1112/blms.12896},
  archiveprefix = {arXiv},
  eprint = {2209.09289},
  author = {Gupta, Pranshu and Hamann, Fabian and Müyesser, Alp and Sgueglia, Amedeo and Parczyk, Olaf},
  title = {A General Approach to Transversal Versions of Dirac-type Theorems}
}

Kohayakawa, Y., Mota, G. O., Schnitzer, J., and Parczyk, O. (2023). Anti-Ramsey Threshold of Complete Graphs for Sparse 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},
  author = {Kohayakawa, Yoshiharu and Mota, Guilherme O. and Schnitzer, Jakob and Parczyk, Olaf},
  title = {Anti-Ramsey Threshold of Complete Graphs for Sparse Graphs}
}

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},
  author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf},
  title = {Anti-Ramsey Threshold of Cycles for Sparse Graphs}
}

Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2022). Triangles in Randomly Perturbed Graphs. Combinatorics, Probability and Computing, 32(1), 91–121. DOI: 10.1017/S0963548322000153 [arXiv]

[BibTeX]

@article{2022_BoettcherAmedeoJozefParczyk_Randomgraphstriangles,
  year = {2022},
  journal = {Combinatorics, Probability and Computing},
  volume = {32},
  number = {1},
  pages = {91-121},
  doi = {10.1017/S0963548322000153},
  archiveprefix = {arXiv},
  eprint = {2011.07612},
  author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
  title = {Triangles in Randomly Perturbed Graphs}
}

Gebhard, O., Hahn-Klimroth, M., Penschuck, M., Rolvien, M., Scarlett, J., Tan, N., and Parczyk, O. (2022). Near Optimal Sparsity-constrained Group Testing: Improved Bounds. 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},
  author = {Gebhard, Oliver and Hahn-Klimroth, Max and Penschuck, Manuel and Rolvien, Maurice and Scarlett, Jonathan and Tan, Nelvin and Parczyk, Olaf},
  title = {Near Optimal Sparsity-constrained Group Testing: Improved Bounds}
}

Clemens, D., Hamann, F., Mogge, Y., and Parczyk, O. (2021). Maker-Breaker Games on Randomly Perturbed Graphs. SIAM Journal on Discrete Mathematics, 35(4), 2734–2748. DOI: 10.1137/20M1385044 [arXiv]

[BibTeX]

@article{2021_DennisFabianYannickParczyk_Makerbreakergames,
  year = {2021},
  journal = {SIAM Journal on Discrete Mathematics},
  volume = {35},
  number = {4},
  pages = {2734-2748},
  doi = {10.1137/20M1385044},
  archiveprefix = {arXiv},
  eprint = {2009.14583},
  author = {Clemens, Dennis and Hamann, Fabian and Mogge, Yannick and Parczyk, Olaf},
  title = {Maker-Breaker Games on Randomly Perturbed Graphs}
}

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, 5, 12pp. DOI: 10.19086/aic.24581 [arXiv]

[BibTeX]

@article{2021_JieEtAl_Sizeramseynumber,
  year = {2021},
  journal = {Advances in Combinatorics},
  volume = {5},
  pages = {12pp},
  doi = {10.19086/aic.24581},
  archiveprefix = {arXiv},
  eprint = {1907.08086},
  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}
}

Hahn-Klimroth, M., Maesaka, G. S., Mogge, Y., Mohr, S., and Parczyk, O. (2021). Random Perturbation of Sparse Graphs. The Electronic Journal of Combinatorics, 28(2), P2.26. DOI: 10.37236/9510 [arXiv]

[BibTeX]

@article{2021_MaxEtAl_Randomsparsegraphs,
  year = {2021},
  journal = {The Electronic Journal of Combinatorics},
  volume = {28},
  number = {2},
  pages = {P2.26},
  doi = {10.37236/9510},
  archiveprefix = {arXiv},
  eprint = {2004.04672},
  author = {Hahn-Klimroth, Max and Maesaka, Giulia S. and Mogge, Yannick and Mohr, Samuel and Parczyk, Olaf},
  title = {Random Perturbation of Sparse Graphs}
}

Allen, P., Koch, C., Person, Y., and Parczyk, O. (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_PeterChristophPersonParczyk_HamiltoncyclesHypergraphs,
  year = {2021},
  journal = {Combinatorics, Probability and Computing},
  volume = {30},
  number = {2},
  pages = {239-257},
  doi = {10.1017/S0963548320000450},
  archiveprefix = {arXiv},
  eprint = {1710.08988},
  author = {Allen, Peter and Koch, Christoph and Person, Yury and Parczyk, Olaf},
  title = {Finding Tight Hamilton Cycles in Random Hypergraphs Faster}
}

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},
  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}
}

Böttcher, J., Montgomery, R., Parczyk, O., and Person, Y. (2020). Embedding Spanning Bounded Degree Graphs 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},
  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},
  primaryclass = {math.CO},
  author = {Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury},
  title = {Embedding Spanning Bounded Degree Graphs in Randomly Perturbed Graphs}
}

Parczyk, O., Elizer, O. B., Hefetz, D., Kronenberg, G., Shikelman, 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_ParczykEtAl_Semirandomgraph,
  year = {2020},
  journal = {Random Structures & Algorithms},
  volume = {56},
  number = {3},
  pages = {648-675},
  doi = {10.1002/rsa.20887},
  archiveprefix = {arXiv},
  eprint = {1805.02259},
  author = {Parczyk, Olaf and Elizer, Omri Ben and Hefetz, Dan and Kronenberg, Gal and Shikelman, Clara and Stojaković, Miloš},
  title = {Semi-random Graph Process}
}

Parczyk, O. (2020). 2-universality in Randomly Perturbed Graphs. European Journal of Combinatorics, 87, 103–118. DOI: 10.1016/j.ejc.2020.103118 [arXiv]

[BibTeX]

@article{2020_Parczyk_2universalityRandomlyperturbedgraphs,
  year = {2020},
  journal = {European Journal of Combinatorics},
  volume = {87},
  pages = {103-118},
  doi = {10.1016/j.ejc.2020.103118},
  archiveprefix = {arXiv},
  eprint = {1902.01823},
  author = {Parczyk, Olaf},
  title = {2-universality in Randomly Perturbed Graphs}
}

Böttcher, J., Montgomery, R., Person, Y., Parczyk, O., Han, J., and Kohayakawa, Y. (2019). Universality of 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},
  author = {Böttcher, Julia and Montgomery, Richard and Person, Yury and Parczyk, Olaf and Han, Jie and Kohayakawa, Yoshiharu},
  title = {Universality of Bounded Degree Spanning Trees in Randomly Perturbed Graphs}
}

Person, Y., and Parczyk, O. (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},
  author = {Person, Yury and Parczyk, Olaf},
  title = {Spanning Structures and Universality in Sparse Hypergraphs}
}

Hetterich, S., Person, Y., and Parczyk, O. (2016). On Universal Hypergraphs. The Electronic Journal of Combinatorics, 23(4), P4.28. DOI: 10.37236/5562 [arXiv]

[BibTeX]

@article{2016_SamuelPersonParczyk_Universalhypergraphs,
  year = {2016},
  journal = {The Electronic Journal of Combinatorics},
  volume = {23},
  number = {4},
  pages = {P4.28},
  doi = {10.37236/5562},
  archiveprefix = {arXiv},
  eprint = {1509.03983},
  author = {Hetterich, Samuel and Person, Yury and Parczyk, Olaf},
  title = {On Universal Hypergraphs}
}

🔬 Projects

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.

MATH+ EF1-12

Jan 2021 to May 2024

💬 Talks and posters

Conference and workshop talks

Jun 2023: New Ramsey Multiplicity Bounds and Search Heuristics
FoCM 2023 Workshop I.3 Workshop, Paris
May 2023: Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable
Berlin-Poznań Seminar, Hamburg
Sep 2022: New Ramsey Multiplicity Bounds and Search Heuristics
DMV Annual Meeting, Berlin
Aug 2022: New Ramsey Multiplicity Bounds and Search Heuristics
20th RS&A Conference, Gniezno
Jun 2022: New Ramsey Multiplicity Bounds and Search Heuristics
Third Southwestern German Workshop on Graph Theory, Heidelberg

View More / Less

Sep 2021: The Square of a Hamilton Cycle in Randomly Perturbed Graphs
Berlin-Poznań Seminar, Będlewo
Jul 2021: Spanning Subgraphs in Randomly Perturbed Graphs
BCC 2021 Conference, Durham
Sep 2020: Factors in Randomly Perturbed Graphs
DMV 2020 Conference, Chemnitz
Sep 2019: The Size-Ramsey Number of Tight 3-Uniform Paths
C&C 2019, Nový Smokovec
Aug 2019: Almost Spanning Universality in Random Graphs
10th EuroComb Conference, Bratislava
Aug 2019: More Non-Bipartite Forcing Pairs
10th EuroComb Conference, Bratislava
Jul 2019: Universality in Randomly Perturbed Graphs
19th RS&A Conference, Zürich
Nov 2018: Universality in Randomly Perturbed Graphs
37th KolKom Conference, Paderborn
Aug 2018: Randomly Perturbed Graphs
First Southwestern German Workshop on Graph Theory, Karlsruhe
Jul 2018: Randomly Perturbed Graphs
Large Networks and Random Graphs Workshop in Frankfurt, Frankfurt
Aug 2017: Embedding Spanning Bounded Degree Subgraphs in Randomly Perturbed Graphs
9th EuroComb Conference, Wien
Aug 2017: Finding Tight Hamilton Cycles in Hypergraphs Faster
18th RS&A Conference, Gniezno
Sep 2016: Explicit Construction of Universal Hypergraphs
PCC 2016 Conference, Będlewo
Nov 2015: Universality in Random and Sparse Hypergraphs
34th KolKom Conference, Ilmenau
Sep 2015: On Spanning Structures in Random Hypergraphs
8th EuroComb Conference, Bergen
Jul 2015: Spanning Structures and Universality in Sparse Random Hypergraphs
17th RS&A Conference, Pittsburgh

Research seminar talks

Feb 2024: Maximal Diameter of Simplicial D-complexes
Seminar on Combinatorics, Games and Optimisation, London
Nov 2023: New Ramsey Multiplicity Bounds and Search Heuristics
Seminar on Discrete Mathematics at Adam Mickiewicz University, Poznan
Oct 2022: A General Approach to Transversal Versions of Dirac-type Theorems
Research Seminar Large Networks and Random Graphs, Ilmenau
Jun 2021: Resilience for Tight Hamilton Cycles in Random Hypergraphs
Research Seminar Combinatorics, Berlin
Mar 2021: Between Probabilistic and Extremal Graph Theory
Algorithm Engineering Group Research Seminar at Hasso-Plattner-Institut, Potsdam

View More / Less

Feb 2021: Resilience for Tight Hamilton Cycles in Random Hypergraphs
Research Seminar Large Networks and Random Graphs, Ilmenau
Dec 2020: Resilience for Tight Hamilton Cycles in Random Hypergraphs
Graz Combinatorics and Optimization Seminar, Graz
Feb 2020: The Size-Ramsey Number of Tight 3-Uniform Paths
Research Seminar at Warwick University, Warwick
Dec 2019: The Size-Ramsey Number of Tight 3-Uniform Paths
Research Seminar Combinatorics, Berlin
Nov 2019: The Size-Ramsey Number of Tight 3-Uniform Paths
Seminar on Combinatorics, Games and Optimisation, London
Jun 2019: The Size-Ramsey Number of Tight 3-Uniform Paths
Forschungsseminar Diskrete Mathematik Und Algebra, Ilmenau
Apr 2019: The Size-Ramsey Number of Powers of Bounded Degree Trees
Forschungsseminar Diskrete Mathematik Und Algebra, Ilmenau
Feb 2018: Randomly Perturbed Graphs
Seminar on Combinatorics, Games and Optimisation, London
Jan 2018: Randomly Perturbed Graphs
Mittagsseminar at ETH Zürich, Zurich
Jun 2017: Embedding Spanning Bounded Degree Subgraphs in Randomly Perturbed Graphs
Combinatorics Seminar at the University of Warwick, Warwick
Mar 2017: Explicit Construction of Universal Hypergraphs
Seminar on Combinatorics, Games and Optimisation, London
Feb 2017: Universality in Random and Sparse Hypergraphs
Extremal Graph Theory Seminar at The Czech Academy of Sciences, Prague
Jan 2016: Universality in Random and Sparse Hypergraphs
Seminar on Combinatorics at USP, São Paulo
Nov 2015: Universality in Random and Sparse Hypergraphs
Research Seminar Combinatorics, Berlin
May 2015: Spanning Structures and Universality in Sparse Random Hypergraphs
Kolloquium Mathematische Informatik at Goethe University Frankfurt, Frankfurt am Main
Dec 2014: On Sidorenko’s Conjecture
AG & Oberseminar Diskrete Mathematik, Frankfurt
Nov 2014: Relative Entropy and Sidorenko’s Conjecture
Research Seminar Combinatorics, Berlin
May 2014: On the Logarithmic Calculus and Sidorenko’s Conjecture
Research Seminar Combinatorics, Berlin

🧑‍🏫Teaching

winter 2023: Lecturer for Discrete Mathematics II - Extremal Combinatorics at FUB
: 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

View More / Less

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 TU Ilmenau
winter 2018: Lecturer for Discrete Mathematics at TU Ilmenau
winter 2018: Assistant for Calculus I at TU Ilmenau
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