| Proof of the 1-factorization and Hamilton decomposition conjectures B Csaba, D Kühn, A Lo, D Osthus, A Treglown American Mathematical Soc., 2016 | 87 | 2016 |
| Proof of the 1-factorization and Hamilton decomposition conjectures B Csaba, D Kühn, A Lo, D Osthus, A Treglown American Mathematical Soc., 2016 | 87 | 2016 |
| Matchings in 3-uniform hypergraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 103 (2), 291-305, 2013 | 85 | 2013 |
| Exact minimum degree thresholds for perfect matchings in uniform hypergraphs A Treglown, Y Zhao Journal of Combinatorial Theory, Series A 119 (7), 1500-1522, 2012 | 71 | 2012 |
| Exact minimum degree thresholds for perfect matchings in uniform hypergraphs A Treglown, Y Zhao Journal of Combinatorial Theory, Series A 119 (7), 1500-1522, 2012 | 71 | 2012 |
| Hamiltonian degree sequences in digraphs D Kühn, D Osthus, A Treglown Journal of Combinatorial Theory, Series B 100 (4), 367-380, 2010 | 69 | 2010 |
| Tilings in randomly perturbed dense graphs J Balogh, A Treglown, AZ Wagner Combinatorics, Probability and Computing 28 (2), 159-176, 2019 | 60 | 2019 |
| Monochromatic triangles in three-coloured graphs J Cummings, D Králʼ, F Pfender, K Sperfeld, A Treglown, M Young Journal of Combinatorial Theory, Series B 103 (4), 489-503, 2013 | 42 | 2013 |
| Monochromatic triangles in three-coloured graphs J Cummings, D Králʼ, F Pfender, K Sperfeld, A Treglown, M Young Journal of Combinatorial Theory, Series B 103 (4), 489-503, 2013 | 42 | 2013 |
| Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu J Han, P Morris, A Treglown Random Structures & Algorithms 58 (3), 480-516, 2021 | 35 | 2021 |
| Sharp bound on the number of maximal sum-free subsets of integers J Balogh, H Liu, M Sharifzadeh, A Treglown submitted, 2018 | 34 | 2018 |
| The number of maximal sum-free subsets of integers J Balogh, H Liu, M Sharifzadeh, A Treglown Proceedings of the American Mathematical Society 143 (11), 4713-4721, 2015 | 31 | 2015 |
| Ramsey properties of randomly perturbed graphs: cliques and cycles S Das, A Treglown Combinatorics, Probability and Computing 29 (6), 830-867, 2020 | 30 | 2020 |
| Independent sets in hypergraphs and Ramsey properties of graphs and the integers R Hancock, K Staden, A Treglown SIAM Journal on Discrete Mathematics 33 (1), 153-188, 2019 | 29 | 2019 |
| Hamilton decompositions of regular tournaments D Kühn, D Osthus, A Treglown Proceedings of the London Mathematical Society 101 (1), 303-335, 2010 | 29 | 2010 |
| A degree sequence Hajnal–Szemerédi theorem A Treglown Journal of Combinatorial Theory, Series B 118, 13-43, 2016 | 28 | 2016 |
| Proof of the -factorization and Hamilton Decomposition Conjectures B Csaba, D Kühn, A Lo, D Osthus, A Treglown arXiv preprint arXiv:1401.4159, 2014 | 28 | 2014 |
| A random version of Sperner's theorem J Balogh, R Mycroft, A Treglown Journal of Combinatorial Theory, Series A 128, 104-110, 2014 | 26 | 2014 |
| Embedding spanning bipartite graphs of small bandwidth F Knox, A Treglown Combinatorics, Probability and Computing 22 (1), 71-96, 2013 | 25 | 2013 |
| An Ore-type theorem for perfect packings in graphs D Kühn, D Osthus, A Treglown SIAM Journal on Discrete Mathematics 23 (3), 1335-1355, 2009 | 25 | 2009 |
