Follow
Olaf Parczyk
Olaf Parczyk
Verified email at zedat.fu-berlin.de
Title
Cited by
Cited by
Year
Universality for bounded degree spanning trees in randomly perturbed graphs
J Böttcher, J Han, Y Kohayakawa, R Montgomery, O Parczyk, Y Person
Random Structures & Algorithms 55 (4), 854-864, 2019
592019
Embedding spanning bounded degree graphs in randomly perturbed graphs
J Böttcher, R Montgomery, O Parczyk, Y Person
Mathematika 66 (2), 422-447, 2020
542020
Semi‐random graph process
O Ben‐Eliezer, D Hefetz, G Kronenberg, O Parczyk, C Shikhelman, ...
Random Structures & Algorithms 56 (3), 648-675, 2020
222020
Spanning structures and universality in sparse hypergraphs
O Parczyk, Y Person
Random Structures & Algorithms 49 (4), 819-844, 2016
202016
The size‐Ramsey number of powers of bounded degree trees
S Berger, Y Kohayakawa, GS Maesaka, T Martins, W Mendonça, GO Mota, ...
Journal of the London Mathematical Society 103 (4), 1314-1332, 2021
192021
Random perturbation of sparse graphs
M Hahn-Klimroth, GS Maesaka, Y Mogge, S Mohr, O Parczyk
arXiv preprint arXiv:2004.04672, 2020
182020
Triangles in randomly perturbed graphs
J Böttcher, O Parczyk, A Sgueglia, J Skokan
Combinatorics, Probability and Computing 32 (1), 91-121, 2023
132023
Near-optimal sparsity-constrained group testing: Improved bounds and algorithms
O Gebhard, M Hahn-Klimroth, O Parczyk, M Penschuck, M Rolvien, ...
IEEE Transactions on Information Theory 68 (5), 3253-3280, 2022
122022
2-universality in randomly perturbed graphs
O Parczyk
European Journal of Combinatorics 87, 103118, 2020
122020
Cycle factors in randomly perturbed graphs
J Böttcher, O Parczyk, A Sgueglia, J Skokan
Procedia Computer Science 195, 404-411, 2021
112021
The size-Ramsey number of 3-uniform tight paths
J Han, Y Kohayakawa, S Letzter, GO Mota, O Parczyk
arXiv preprint arXiv:1907.08086, 2019
112019
A general approach to transversal versions of Dirac‐type theorems
P Gupta, F Hamann, A Müyesser, O Parczyk, A Sgueglia
Bulletin of the London Mathematical Society 55 (6), 2817-2839, 2023
92023
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
J Böttcher, R Montgomery, O Parczyk, Y Person
Electronic Notes in Discrete Mathematics 61, 155-161, 2017
92017
On spanning structures in random hypergraphs
O Parczyk, Y Person
Electronic Notes in Discrete Mathematics 49, 611-619, 2015
62015
Anti-Ramsey threshold of cycles
GF Barros, BP Cavalar, GO Mota, O Parczyk
Discrete Applied Mathematics 323, 228-235, 2022
52022
New Ramsey multiplicity bounds and search heuristics
O Parczyk, S Pokutta, C Spiegel, T Szabó
Discrete Mathematics Days 2022 263, 224, 2022
52022
Resilience for tight Hamiltonicity
P Allen, O Parczyk, V Pfenninger
arXiv preprint arXiv:2105.04513, 2021
52021
The square of a Hamilton cycle in randomly perturbed graphs
J Böttcher, O Parczyk, A Sgueglia, J Skokan
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
52021
The anti-Ramsey threshold of complete graphs
Y Kohayakawa, GO Mota, O Parczyk, J Schnitzer
arXiv preprint arXiv:1902.00306, 2019
52019
The anti-Ramsey threshold of complete graphs
Y Kohayakawa, GO Mota, O Parczyk, J Schnitzer
Discrete Mathematics 346 (5), 113343, 2023
42023
The system can't perform the operation now. Try again later.
Articles 1–20