![]() | Up a level |
Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef
ORCID: 0000-0003-3996-7676
(2024)
The square of a Hamilton cycle in randomly perturbed graphs.
Random Structures and Algorithms, 65 (2).
342 - 386.
ISSN 1042-9832
Allen, Peter ORCID: 0000-0001-6555-3501, Parczyk, Olaf and Pfenninger, Vincent
(2024)
Resilience for tight Hamiltonicity.
Combinatorial Theory, 4 (1).
ISSN 2766-1334
Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef
ORCID: 0000-0003-3996-7676
(2023)
Triangles in randomly perturbed graphs.
Combinatorics, Probability and Computing, 32 (1).
91 - 121.
ISSN 0963-5483
Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef
ORCID: 0000-0003-3996-7676
(2022)
Cycle factors in randomly perturbed graphs.
Procedia Computer Science, 195.
404 - 411.
ISSN 1877-0509
Han, Jie, Kohayakawa, Yoshiharu, Letzter, Shoham, Mota, Guilherme Oliveira and Parczyk, Olaf (2021) The size-Ramsey Number of 3-uniform tight paths. Advances in Combinatorics, 2021 (1). ISSN 2517-5599
Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Mota, Guilherme Oliveira and Parczyk, Olaf (2021) The size-Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, 103 (4). 1314 - 1332. ISSN 0024-6107
Hahn-Klimroth, Max, Maesaka, Giulia S., Mogge, Yannick, Mohr, Samuel and Parczyk, Olaf (2021) Random perturbation of sparse graphs. Electronic Journal of Combinatorics, 28 (2). ISSN 1077-8926
Böttcher, Julia ORCID: 0000-0002-4104-3635, Montgomery, Richard, Parczyk, Olaf and Person, Yury
(2020)
Embedding spanning bounded degree graphs in randomly perturbed graphs.
Mathematika, 66 (2).
422 - 447.
ISSN 0025-5793
Allen, Peter ORCID: 0000-0001-6555-3501, Koch, Christoph, Parczyk, Olaf and Person, Yury
(2020)
Finding tight Hamilton cycles in random hypergraphs faster.
Combinatorics, Probability and Computing.
ISSN 0963-5483
Böttcher, Julia ORCID: 0000-0002-4104-3635, Han, Jie, Kohayakawa, Yoshiharu, Montgomery, Richard, Parczyk, Olaf and Person, Yury
(2019)
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Structures and Algorithms, 55 (4).
pp. 854-864.
ISSN 1042-9832
Böttcher, Julia ORCID: 0000-0002-4104-3635, Montgomery, Richard, Parczyk, Olaf and Person, Yury
(2017)
Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Electronic Notes in Discrete Mathematics, 61.
pp. 155-161.
ISSN 1571-0653
Clemens, Dennis, Hamann, Fabian, Mogge, Yannick and Parczyk, Olaf (2021) Waiter-Client games on randomly perturbed graphs. In: Nešetřil, Jaroslav, Perarnau, Guillem, Rué, Juanjo and Serra, Oriol, (eds.) Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications. Trends in Mathematics. Springer Science and Business Media Deutschland GmbH, Cham, CH, 397 - 403. ISBN 9783030838225
Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef
ORCID: 0000-0003-3996-7676
(2021)
The square of a Hamilton cycle in randomly perturbed graphs.
In: Nešetřil, Jaroslav, Perarnau, Guillem, Rué, Juanjo and Serra, Oriol, (eds.)
Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications.
Research Perspectives CRM Barcelona.
Birkhäuser (Firm), Cham, CH, 644 - 650.
ISBN 9783030838225
Allen, Peter ORCID: 0000-0001-6555-3501, Koch, Christoph, Parczyk, Olaf and Person, Yury
(2018)
Finding tight hamilton cycles in random hypergraphs faster.
In: Bender, M., Farach-Colton, M. and Mosteiro, M., (eds.)
LATIN 2018: theoretical informatics.
Lecture Notes in Computer Science (10807).
Springer Berlin / Heidelberg, Cham, Switzerland, pp. 28-36.
ISBN 9783319774039