| The existence of designs via iterative absorption: hypergraph 𝐹-designs for arbitrary 𝐹 S Glock, D Kühn, A Lo, D Osthus American Mathematical Society 284 (1406), 2023 | 93 | 2023 |
| The existence of designs via iterative absorption: hypergraph -designs for arbitrary S Glock, D Kühn, A Lo, D Osthus arXiv preprint arXiv:1611.06827, 2016 | 89 | 2016 |
| Hypergraph -designs for arbitrary S Glock, D Kühn, A Lo, D Osthus arXiv preprint arXiv:1706.01800, 2017 | 48 | 2017 |
| Resolution of the Oberwolfach problem S Glock, F Joos, J Kim, D Kühn, D Osthus Journal of the European Mathematical Society 23 (8), 2511-2547, 2021 | 45 | 2021 |
| On the decomposition threshold of a given graph S Glock, D Kühn, A Lo, R Montgomery, D Osthus Journal of Combinatorial Theory, Series B 139, 47-127, 2019 | 44 | 2019 |
| On a conjecture of Erdős on locally sparse Steiner triple systems S Glock, D Kühn, A Lo, D Osthus arXiv preprint arXiv:1802.04227, 2018 | 38 | 2018 |
| Pseudorandom hypergraph matchings S Ehard, S Glock, F Joos Combinatorics, Probability and Computing 29 (6), 868-885, 2020 | 35 | 2020 |
| Conflict-free hypergraph matchings S Glock, F Joos, J Kim, M Kühn, L Lichev Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 34 | 2023 |
| Optimal path and cycle decompositions of dense quasirandom graphs S Glock, D Kühn, D Osthus Journal of Combinatorial Theory, Series B 118, 88-108, 2016 | 34 | 2016 |
| Decompositions into isomorphic rainbow spanning trees S Glock, D Kühn, R Montgomery, D Osthus Journal of Combinatorial Theory, Series B 146, 439-484, 2021 | 31 | 2021 |
| Minimalist designs B Barber, S Glock, D Kühn, A Lo, R Montgomery, D Osthus Random Structures & Algorithms 57 (1), 47-63, 2020 | 31 | 2020 |
| Triple systems with no three triples spanning at most five points S Glock Bulletin of the London Mathematical Society 51 (2), 230-236, 2019 | 24 | 2019 |
| A rainbow blow‐up lemma S Glock, F Joos Random Structures & Algorithms 56 (4), 1031-1069, 2020 | 22 | 2020 |
| An average degree condition for independent transversals S Glock, B Sudakov Journal of Combinatorial Theory, Series B 154, 370-391, 2022 | 21 | 2022 |
| Extremal aspects of graph and hypergraph decomposition problems S Glock, D Kühn, D Osthus Surveys in Combinatorics, London Math. Soc. Lecture Note Ser 470, 235-265, 2020 | 19 | 2020 |
| A rainbow blow-up lemma for almost optimally bounded edge-colourings S Ehard, S Glock, F Joos Forum of Mathematics, Sigma 8, e37, 2020 | 19 | 2020 |
| Euler tours in hypergraphs S Glock, F Joos, D Kühn, D Osthus arXiv preprint arXiv:1808.07720, 2018 | 17 | 2018 |
| New results for MaxCut in H‐free graphs S Glock, O Janzer, B Sudakov Journal of the London Mathematical Society 108 (2), 441-481, 2023 | 16 | 2023 |
| On the (6, 4)-problem of Brown, Erdős, and Sós S Glock, F Joos, J Kim, M Kühn, L Lichev, O Pikhurko Proceedings of the American Mathematical Society, Series B 11 (17), 173-186, 2024 | 15 | 2024 |
| Counting Hamilton cycles in Dirac hypergraphs S Glock, S Gould, F Joos, D Kühn, D Osthus Combinatorics, Probability and Computing 30 (4), 631-653, 2021 | 13 | 2021 |
Daniela KuhnUniversity of BirminghamPatvirtintas el. paštas bham.ac.uk