Proof of the 1-factorization and Hamilton decomposition conjectures B Csaba, D Kühn, A Lo, D Osthus, A Treglown
American Mathematical Society 244 (1154), 2016
102 2016 Matchings in 3-uniform hypergraphs D Kühn, D Osthus, A Treglown
Journal of Combinatorial Theory, Series B 103 (2), 291-305, 2013
94 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
81 2012 Hamiltonian degree sequences in digraphs D Kühn, D Osthus, A Treglown
Journal of Combinatorial Theory, Series B 100 (4), 367-380, 2010
75 2010 Tilings in randomly perturbed dense graphs J Balogh, A Treglown, AZ Wagner
Combinatorics, Probability and Computing 28 (2), 159-176, 2019
66 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
49 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
41 2021 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
38 2019 Sharp bound on the number of maximal sum-free subsets of integers J Balogh, H Liu, M Sharifzadeh, A Treglown
submitted, 2018
36 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
33 2015 Ramsey properties of randomly perturbed graphs: cliques and cycles S Das, A Treglown
Combinatorics, Probability and Computing 29 (6), 830-867, 2020
32 2020 Hamilton decompositions of regular tournaments D Kühn, D Osthus, A Treglown
Proceedings of the London Mathematical Society 101 (1), 303-335, 2010
31 2010 A degree sequence Hajnal–Szemerédi theorem A Treglown
Journal of Combinatorial Theory, Series B 118, 13-43, 2016
30 2016 A random version of Sperner's theorem J Balogh, R Mycroft, A Treglown
Journal of Combinatorial Theory, Series A 128, 104-110, 2014
28 2014 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 The complexity of perfect matchings and packings in dense hypergraphs J Han, A Treglown
Journal of Combinatorial Theory, Series B 141, 72-104, 2020
26 * 2020 A note on perfect matchings in uniform hypergraphs A Treglown, Y Zhao
arXiv preprint arXiv:1503.03357, 2015
26 2015 Embedding spanning bipartite graphs of small bandwidth F Knox, A Treglown
Combinatorics, Probability and Computing 22 (1), 71-96, 2013
26 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 A discrepancy version of the Hajnal–Szemerédi theorem J Balogh, B Csaba, A Pluhár, A Treglown
Combinatorics, Probability and Computing 30 (3), 444-459, 2021
24 2021