My research interests include probabilistic and extremal
combinatorics, Ramsey theory, and computational mathematics. I primarily
work on graph-embedding problems, often involving randomness in one form
or another.
Publications
Preprints
Triangle Factors in the Semi-Random Graph Process
with Eva Schinzel. arXiv:2611.13959.
The maximum diameter of d-dimensional simplicial
complexes with Stefan Glock, Silas Rathke, and Tibor Szabó. arXiv:2602.20890.
Adjunctions, Box Products, and Forcing Families
with Aldo Kiem and Christoph Spiegel. arXiv:2412.12904.
Published
Graphs with large minimum degree and no short odd cycles are
3-colourable with Julia Böttcher, Nóra Frankl, Domenico Mergoni
Cecchelli, and Jozef Skokan. Combinatorial Theory6, no 3 (2026). DOI, arXiv.
The maximum diameter of 2-dimensional simplicial
complexes with Silas Rathke and Tibor Szabó, Discrete &
Computational Geometry76, 1687–1724 (2026). DOI, arXiv.
An Unsure Note on an Un-Schur Problem with Christoph
Spiegel, The Electronic Journal of Combinatorics33 (2026), no 1, P1.45. DOI, arXiv.
Dirac’s Theorem for Graphs of Bounded Bandwidth with
Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, and
Amedeo Sgueglia, The Electronic Journal of Combinatorics33 (2026), no 1, P1.21. DOI, arXiv.
Spanning Spheres in Dirac Hypergraphs with Freddie
Illingworth, Richard Lang, Alp Müyesser, and Amedeo Sgueglia.
Combinatorica45, 43 (2025). DOI, arXiv.
On product Schur triples in the integers with Letícia
Mattos and Domenico Mergoni Cecchelli. SIAM Journal on Discrete
Mathematics39, no 2 (2025), 1082-1095. DOI, arXiv.
New Ramsey Multiplicity Bounds and Search Heuristics
with Sebastian Pokutta, Christoph Spiegel, and Tibor Szabó.
Foundations of Computational Mathematics (2024). DOI, arXiv.
Minimum degree conditions for containing an r-regular
r-connected subgraph with Max Hahn-Klimroth and Yury Person.
European Journal of Combinatorics, 118 (2024),
103940. DOI, arXiv.
Resilience for tight Hamiltonicity with Peter Allen and
Vincent Pfenninger. Combinatorial Theory, 4,
no 1 (2024), #9. DOI, arXiv.
The square of a Hamilton cycle in randomly perturbed
graphs with Julia Böttcher, Amedeo Sgueglia, and Jozef Skokan.
Random Structures & Algorithms (2024), 1–45. DOI, arXiv.
A general approach to transversal versions of Dirac-type
theorems with Pranshu Gupta, Fabian Hamman, Alp Müyesser, and
Amedeo Sgueglia, Bull. London Math. Soc.55
(2023), 2817–2839. DOI,
arXiv.
Anti-Ramsey threshold of complete graphs for sparse
graphs with Yoshiharu Kohayakawa, Guilherme O. Mota, and Jakob
Schnitzer, Discrete Mathematics346 (2023), no
5, 113343. DOI,
arXiv.
Triangles in randomly perturbed graphs with Julia
Böttcher, Amedeo Sgueglia, and Jozef Skokan, Combinatorics,
Probability and Computing32 (2022), no 1, 91–121.
DOI, arXiv.
Near optimal sparsity-constrained group testing: improved
bounds with Oliver Gebhard, Max Hahn-Klimroth, Manuel
Penschuck, Maurice Rolvien, Jonathan Scarlett, and Nelvin Tan, IEEE
Transactions on Information Theory68 (2022), no
5, 3253–3280. DOI, arXiv.
Maker-Breaker Games on Randomly Perturbed Graphs with
Dennis Clemens, Fabian Hamann, and Yannick Mogge, SIAM Journal on
Discrete Mathematics35 (2021), no 4, 2734–2748.
DOI, arXiv.
Anti-Ramsey threshold of cycles with Garbiel F. Barros,
Bruno P. Cavalar, and Guilherme O. Mota, Discrete Applied
Mathematics323 (2022) 228-235. DOI, arXiv.
The size-Ramsey number of 3-uniform tight paths with
Jie Han, Yoshiharu Kohayakawa, Shoham Letzter, and Guilherme O. Mota,
Advances in Combinatorics (2021:5), 12pp. DOI, arXiv.
Random perturbation of sparse graphs with Max
Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, and Samuel Mohr,
The Electronic Journal of Combinatorics28
(2021), no 2, P2.26. DOI, arXiv.
The size-Ramsey number of powers of bounded degree
trees with Sören Berger, Yoshiharu Kohayakawa, Giulia S.
Maesaka, Taísa Martins, Walner Mendonça, and Guilherme O. Mota.
Journal of the London Mathematical Society103
(2021), no 4, 1314–1332. DOI, arXiv.
Finding tight Hamilton cycles in random hypergraphs
faster with Peter Allen, Christoph Koch, and Yury Person.
Combinatorics, Probability and Computing30
(2021), no 2, 239–257. DOI, arXiv.
Embedding spanning bounded degree graphs in randomly perturbed
graphs with Julia Böttcher, Richard Montgomery, and Yury
Person. Mathematika66 (2020), no 2, 422–447.
DOI, arXiv.
2-universality in randomly perturbed graphs.
European Journal of Combinatorics87 (2020),
103–118. DOI, arXiv.
Semi-random graph process with Omri Ben Eliezer, Dan
Hefetz, Gal Kronenberg, Clara Shikelman, and Miloš Stojaković.
Random Structures & Algorithms56 (2020),
no 3, 648–675. DOI, arXiv.
Universality of bounded degree spanning trees in randomly
perturbed graphs with Julia Böttcher, Jie Han, Yoshiharu
Kohayakawa, Richard Montgomery, and Yury Person. Random Structures
& Algorithms55 (2019), no 4, 854–864. DOI, arXiv.
Spanning structures and universality in sparse
hypergraphs with Yury Person. Random Structures &
Algorithms49 (2016), no 4, 819–844. DOI, arXiv.
On universal hypergraphs with Samuel Hetterich and Yury
Person. The Electronic Journal of Combinatorics23 (2016), no 4, P4.28. DOI, arXiv.
Conference Proceedings
Fully Computer-Assisted Proofs in Extremal
Combinatorics wit Sebastian Pokutta, Christoph Spiegel, and
Tibor Szabó, Proceedings of the AAAI Conference on Artificial
Intelligence37, no 10, (2023), 12482-12490. DOI.
The square of a Hamilton cycle in randomly perturbed
graphs with Julia Böttcher, Amedeo Sgueglia, and Jozef Skokan,
Extended Abstracts EuroComb 2021, Trends in Mathematics
14, Birkhäuser, Cham (2021), 644–650. DOI.
Waiter-Client Games on Randomly Perturbed Graphs
with Dennis Clemens, Fabian Hamann, and Yannick Mogge, Extended
Abstracts EuroComb 2021, Trends in Mathematics 14,
Birkhäuser, Cham (2021), 397–403. DOI.
Cycle factors in randomly perturbed graphs with
Julia Böttcher, Amedeo Sgueglia, and Jozef Skokan. Procedia Computer
Science195 (2021), 404–411. Proceedings of the XI
Latin and American Algorithms, Graphs and Optimization Symposium. DOI.
The size-Ramsey number of powers of bounded degree
trees with Sören Berger, Yoshiharu Kohayakawa, Giulia S.
Maesaka, Taísa Martins, Walner Mendonça, and Guilherme O. Mota. Acta
Mathematica Universitatis Comenianae88 (2019), no
3, 451–456. URL.
More non-bipartite forcing pairs with Tamas Hubai,
Dan Král, and Yury Person. Acta Mathematica Universitatis
Comenianae88 (2019), no 3, 819–825. URL,
arXiv.
Almost spanning universality in random graphs.
Acta Mathematica Universitatis Comenianae88
(2019), no 3, 997–1002. URL.
Anti-Ramsey threshold of cycles for sparse graphs
with Gabriel F. Barros, Bruno P. Cavalar, and Guilherme O. Mota.
Electronic Notes in Theoretical Computer Science346 (2019), 89–98. DOI, arXiv.
Finding tight Hamilton cycles in random hypergraphs
faster with Peter Allen, Christoph Koch, and Yury Person.
LATIN 2018: Theoretical Informatics. LATIN 2018. Lecture Notes
in Computer Science, vol 10807. Springer, Cham. DOI.
Embedding spanning bounded degree subgraphs in randomly
perturbed graphs with Julia Böttcher, Richard Montgomery, and
Yury Person. Electronic Notes in Discrete Mathematics61 (2017), 155–161. DOI.
On spanning structures in random hypergraphs with
Yury Person. Electronic Notes in Discrete Mathematics49 (2015), 611–619. DOI.
Thesis Supervision
Master
Vanessa Hiebeler (2026) Embedding Spanning Structures into
the Random Geometric Graph
Eva Schinzel (2025) Clique Factors in the Semi-Random Graph
Process
Niall Smith (2025) Discrepancy of Hamilton Cycles in Random
Subgraphs
Bachelor
Kazim Koc (2026) Hamiltonkreise in
Zufallsgraphen
Nikita Painemal (2025) Über die Anzahl von
Schur-Tripeln
Luis Böhme (2025) Die Singularität von zufälligen
Matrizen
Pascal Weihnhart (2025) Embedding Spanning Trees in
(n,d,λ)-graphs via Sorting Networks
Teaching
Wahrscheinlichkeitstheorie und Statistik, FU Berlin, WT 2025