Publikationen
Manuskripte
-
Ramsey-type results for Maker-Breaker games,
mit Alexander Allin und Juri Barkey,
manuscript, 2026. [arXiv] -
On Ramsey-type problems for paths and cycles with few colour changes,
mit Peter Allen, Julia Böttcher, Fabian Hamann, Jozef Skokan und Anusch Taraz,
manuscript, 2026. [arXiv] -
Rainbow connectivity Maker-Breaker game,
mit Juri Barkey, Bruno Borchardt, Milica Maksimović, Mirjana Mikalački und Miloš Stojaković,
manuscript, 2026. [arXiv] -
The tree packing conjecture for trees of almost linear maximum degree,
mit Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet und Anusch Taraz,
manuscript, 2021. [arXiv]
Veröffentlicht
-
Maker playing against an invisible Breaker,
mit Fabian Hamann, Mirjana Mikalački, Yannick Mogge und Miloš Stojaković,
Discrete Mathematics 350(2), 2026. [DOI, arXiv] -
Constructions for positional games and applications to domination games,
mit Ali Deniz Bagdas, Fabian Hamann und Yannick Mogge,
The Electronic Journal of Combinatorics, P3-47, 2026. [DOI, arXiv] -
Creating spanning trees in Waiter-Client games,
mit Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga, Fabian Hamann und Yannick Mogge,
The Electronic Journal of Combinatorics, P3-35, 2025. [DOI, arXiv] -
Tree universality in positional games,
mit Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdȩga, Fabian Hamann und Yannick Mogge,
Combinatorics, Probability and Computing 34.3, 338-358, 2025. [DOI, arXiv] -
Ramsey simplicity of random graphs,
mit Simona Boyadzhiyska, Shagnik Das und Pranshu Gupta,
Combinatorics, Probability and Computing 34.2, 298-320, 2025. [DOI, arXiv] -
Ramsey equivalence for asymmetric pairs of graphs,
mit Simona Boyadzhiyska, Pranshu Gupta und Jonathan Rollin,
SIAM Journal on Discrete Mathematics 38.1, 55-74, 2024. [DOI, arXiv] -
Walker-Breaker Games on Gn,p,
mit Pranshu Gupta und Yannick Mogge,
The Electronic Journal of Combinatorics, 31.4, 2024. [DOI, arXiv] -
Multistage positional games,
mit Juri Barkey, Fabian Hamann, Mirjana Mikalački und Amedeo Sgueglia,
Discrete Mathematics 346.9, 113478, 2023. [DOI, arXiv] -
Perfectly packing graphs with bounded degeneracy and many leaves,
mit Peter Allen, Julia Böttcher und Anusch Taraz,
Israel Journal of Mathematics 255.2, 501-579, 2023. [DOI, arXiv] -
On the minimum degree of minimal Ramsey graphs for cliques versus cycles,
mit Anurag Bishnoi, Simona Boyadzhiyska, Pranshu Gupta, Thomas Lesgourgues und Anita Liebenau,
SIAM Journal on Discrete Mathematics 37.1, 25-50, 2023. [DOI, arXiv] -
Minimal Ramsey graphs with many vertices of small degree,
mit Simona Boyadzhiyska und Pranshu Gupta,
SIAM Journal on Discrete Mathematics 36.3, 1503-1528, 2022. [DOI, arXiv] -
Maker-Breaker games on randomly perturbed graphs,
mit Fabian Hamann, Yannick Mogge und Olaf Parczyk,
SIAM Journal on Discrete Mathematics 35(4), p. 2723–2748, 2021. [DOI] -
Connector-Breaker games on random boards,
mit Laurin Kirsch und Yannick Mogge,
The Electronic Journal of Combinatorics 28(3), P3.10, 2021. [DOI, arXiv] -
On the size Ramsey number of grid graphs,
mit Meysam Miralaei, Damian Reding, Mathias Schacht und Anusch Taraz,
Combinatorics, Probability and Computing, p. 1–16, 2021. [DOI, arXiv] -
A Dirac-type Theorem for Hamilton Berge Cycles in Random Hypergraphs,
mit Julia Ehrenmüller und Yury Person,
The Electronic Journal of Combinatorics 27(3), P3.39, 2020. [DOI, arXiv] -
Fast Strategies in Waiter-Client Games,
mit Pranshu Gupta, Fabian Hamann, Alexander Haupt, Mirjana Mikalački und Yannick Mogge,
The Electronic Journal of Combinatorics 27(3), P 3.57, 2020. [DOI, arXiv] -
On minimal Ramsey graphs and Ramsey equivalence in multiple colours,
mit Anita Liebenau und Damian Reding,
Combinatorics, Probability and Computing 29(4), p. 537–554, 2020. [DOI, arXiv] -
The size-Ramsey number of powers of paths,
mit Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding und Barnaby Roberts,
Journal of Graph Theory 91(3), p. 290–299, 2019. [DOI, arXiv] -
Colourings without monochromatic disjoint pairs,
mit Shagnik Das und Tuan Tran,
European Journal of Combinatorics 70, p. 99–124, 2018. [DOI, arXiv] -
How fast can Maker win in fair biased games?,
mit Mirjana Mikalački,
Discrete Mathematics 341(1), p. 51–66, 2018. [DOI, arXiv] -
A non-trivial upper bound on the threshold bias of the Oriented-cycle game,
mit Anita Liebenau,
Journal of Combinatorial Theory Series B 122, p. 21–54, 2017. [DOI, arXiv] -
On sets not belonging to algebras and rainbow matchings in graphs,
mit Julia Ehrenmüller und Alexey Pokrovskiy,
Journal of Combinatorial Theory Series B 122, p. 109–120, 2017. [DOI, arXiv] -
An improved bound on the size of matchings guaranteeing a rainbow matching,
mit Julia Ehrenmüller,
The Electronic Journal of Combinatorics 23(2), P2.11, 2016. [DOI, arXiv] -
Creating cycles in Walker-Breaker games,
mit Tuan Tran,
Discrete Mathematics 339, p. 2113–2126, 2016. [DOI, arXiv] -
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs,
mit Yury Person,
Combinatorics, Probability and Computing 25, p. 850–869, 2016. [DOI, arXiv] -
The random graph intuition for the tournament game,
mit Anita Liebenau,
Combinatorics, Probability and Computing 25, p. 76–88, 2016. [DOI, arXiv] -
A remark on the tournament game,
mit Mirjana Mikalački,
The Electronic Journal of Combinatorics 22(3), P3.42, 2015. [DOI, arXiv] -
Building spanning trees quickly in Maker-Breaker games,
mit Asaf Ferber, Roman Glebov, Dan Hefetz und Anita Liebenau,
SIAM Journal on Discrete Mathematics 29, p. 1683–1705, 2015. [DOI, arXiv] -
Keeping Avoider’s graph almost acyclic,
mit Julia Ehrenmüller, Yury Person und Tuan Tran,
The Electronic Journal of Combinatorics 22(1), P1.60, 2015. [DOI, arXiv] -
Fast strategies in Maker-Breaker games played on random boards,
mit Asaf Ferber, Michael Krivelevich und Anita Liebenau,
Combinatorics, Probability and Computing 21, p. 897–915, 2012. [DOI, arXiv]