Olaf Parczyk

Contact

Room
3035
Phone
+49 30 84185-365
Email

Publications

2024
Minimum degree conditions for containing an r-regular r-connected subgraph European Journal of Combinatorics, 2024 Max Hahn-Klimroth, Yury Person, Olaf Parczyk BibTeX
Parczyk, Olaf, Dr.
New Ramsey multiplicity bounds and search heuristics Foundations of Computational Mathematics, 2024 Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó BibTeX
DOI
Parczyk, Olaf, Dr.
Resilience for tight Hamiltonicity Combinatorial Theory, 4(1), 2024 Peter Allen, Vincent Pfenninger, Olaf Parczyk BibTeX
DOI
Parczyk, Olaf, Dr.
The square of a Hamilton cycle in randomly perturbed graphs Random Structures & Algorithms, 65(2), pp. 342-386, 2024 Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan BibTeX
DOI
Parczyk, Olaf, Dr.
2023
A general approach to transversal versions of Dirac-type theorems Bulletin of the London Mathematical Society, 2023 Pranshu Gupta, Fabian Hamann, Alp Müyesser, Amedeo Sgueglia, Olaf Parczyk BibTeX
Parczyk, Olaf, Dr.
Anti-Ramsey threshold of complete graphs for sparse graphs Discrete Mathematics, 2023 Yoshiharu Kohayakawa, Guilherme O. Mota, Jakob Schnitzer, Olaf Parczyk BibTeX
Parczyk, Olaf, Dr.
2022
Anti-Ramsey threshold of cycles for sparse graphs Discrete Applied Mathematics, 2022 Gabriel F. Barros, Bruno P. Cavalar, Guilherme O. Mota, Olaf Parczyk BibTeX
Parczyk, Olaf, Dr.
Near optimal sparsity-constrained group testing: improved bounds IEEE Transactions on Information Theory, 2022 Oliver Gebhard, Max Hahn-Klimroth, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, Nelvin Tan, Olaf Parczyk BibTeX
Parczyk, Olaf, Dr.
Triangles in randomly perturbed graphs Combinatorics, Probability and Computing, 2022 Julia Böttcher, Amedeo Sgueglia, Jozef Skokan, Olaf Parczyk BibTeX
Parczyk, Olaf, Dr.