| Publication | Date of Publication | Type |
|---|
| On the anti-Ramsey threshold for non-balanced graphs | 2024-04-18 | Paper |
| Counting orientations of random graphs with no directed k‐cycles | 2024-03-25 | Paper |
| Separating path systems in complete graphs | 2023-12-22 | Paper |
| Factors in randomly perturbed hypergraphs | 2023-10-12 | Paper |
| Resilience for Loose Hamilton Cycles | 2023-09-25 | Paper |
| A canonical Ramsey theorem with list constraints in random graphs | 2023-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5884595 | 2023-03-23 | Paper |
| The anti-Ramsey threshold of complete graphs | 2023-03-10 | Paper |
| Directed graphs with lower orientation Ramsey thresholds | 2022-11-13 | Paper |
| Anti-Ramsey threshold of cycles | 2022-11-02 | Paper |
| Counting orientations of graphs with no strongly connected tournaments | 2022-09-26 | Paper |
| The threshold for the constrained Ramsey property | 2022-07-11 | Paper |
| Anti-Ramsey threshold of cycles for sparse graphs | 2022-04-27 | Paper |
| On edge-magic labelings of forests | 2022-04-27 | Paper |
| Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges | 2022-04-27 | Paper |
| Decomposing split graphs into locally irregular graphs | 2022-04-27 | Paper |
| The size-Ramsey number of 3-uniform tight paths | 2021-11-05 | Paper |
| The size‐Ramsey number of powers of bounded degree trees | 2021-08-13 | Paper |
| Covering 3-Edge-Colored Random Graphs with Monochromatic Trees | 2021-06-28 | Paper |
| On the local density problem for graphs of given odd-girth | 2021-06-25 | Paper |
| Decomposing split graphs into locally irregular graphs | 2021-02-01 | Paper |
| Counting restricted orientations of random graphs | 2020-10-26 | Paper |
| The multicolour size-Ramsey number of powers of paths | 2020-09-24 | Paper |
| Counting graph orientations with no directed triangles | 2020-05-26 | Paper |
| Powers of tight Hamilton cycles in randomly perturbed hypergraphs | 2020-02-14 | Paper |
| The size‐Ramsey number of powers of paths | 2019-08-15 | Paper |
| Counting Gallai 3-colorings of complete graphs | 2019-07-18 | Paper |
| Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version | 2019-03-05 | Paper |
| The anti-Ramsey threshold of complete graphs | 2019-02-01 | Paper |
| Monochromatic trees in random graphs | 2019-01-31 | Paper |
| Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth | 2019-01-23 | Paper |
| Decomposing highly connected graphs into paths of length five | 2018-05-24 | Paper |
| On the local density problem for graphs of given odd-girth | 2018-04-09 | Paper |
| On an anti‐Ramsey threshold for sparse graphs with one triangle | 2018-02-23 | Paper |
| Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version | 2018-01-18 | Paper |
| On the number of \(r\)-transitive orientations of \(G(n,p)\) | 2018-01-18 | Paper |
| Monochromatic trees in random graphs | 2018-01-18 | Paper |
| Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version | 2017-10-24 | Paper |
| Decomposing regular graphs with prescribed girth into paths of given length | 2017-09-11 | Paper |
| Counting results for sparse pseudorandom hypergraphs. I. | 2017-08-31 | Paper |
| Counting results for sparse pseudorandom hypergraphs. II. | 2017-08-31 | Paper |
| Edge-magic labelings for constellations and armies of caterpillars | 2017-08-15 | Paper |
| Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version | 2017-02-13 | Paper |
| Decomposing highly edge-connected graphs into paths of any given length | 2016-11-25 | Paper |
| Decompositions of highly connected graphs into paths of length five | 2016-10-17 | Paper |
| A counting lemma for sparse pseudorandom hypergraphs | 2016-10-17 | Paper |
| Path decompositions of regular graphs with prescribed girth | 2016-10-14 | Paper |
| Decompositions of highly connected graphs into paths of any given length | 2016-10-14 | Paper |
| Decompositions of triangle-free 5-regular graphs into paths of length five | 2015-06-29 | Paper |
| Ramsey numbers for bipartite graphs with small bandwidth | 2015-06-02 | Paper |
| On an anti-Ramsey threshold for random graphs | 2014-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419960 | 2014-06-11 | Paper |
| A note on counting orientations | 2013-07-23 | Paper |
| On an anti-Ramsey property of random graphs | 2013-07-23 | Paper |
| Separating path systems in complete graphs | 0001-01-03 | Paper |
