The existence of designs via iterative absorption S Glock, D Kühn, A Lo, D Osthus
arXiv preprint arXiv:1611.06827, 3120-3122, 2016
181 * 2016 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
113 2016 Edge-decompositions of graphs with high minimum degree B Barber, D Kühn, A Lo, D Osthus
Advances in Mathematics 288, 337-385, 2016
86 2016 A Lo, K Markström
Graphs and Combinatorics 31, 679-712, 2015
81 2015 Properly coloured Hamiltonian cycles in edge-coloured complete graphs A Lo
Combinatorica 36, 471-492, 2016
47 2016 Clique decompositions of multipartite graphs and completion of Latin squares B Barber, D Kühn, A Lo, D Osthus, A Taylor
Journal of Combinatorial Theory, Series A 151, 146-201, 2017
45 2017 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 An edge-colored version of Dirac's theorem A Lo
SIAM Journal on Discrete Mathematics 28 (1), 18-36, 2014
43 2014 On a conjecture of Erdős on locally sparse Steiner triple systems S Glock, D Kühn, A Lo, D Osthus
Combinatorica 40 (3), 363-403, 2020
38 2020 A multipartite version of the Hajnal–Szemerédi theorem for graphs and hypergraphs A Lo, K Markström
Combinatorics, Probability and Computing 22 (1), 97-111, 2013
35 2013 Fractional clique decompositions of dense graphs and hypergraphs B Barber, D Kühn, A Lo, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 127, 148-186, 2017
34 2017 A Dirac type condition for properly coloured paths and cycles A Lo
Journal of Graph Theory 76 (1), 60-87, 2014
32 2014 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 The robust component structure of dense regular graphs and applications D Kühn, A Lo, D Osthus, K Staden
Proceedings of the London Mathematical Society 110 (1), 19-56, 2015
30 2015 Minimum codegree threshold for (K43− e)-factors A Lo, K Markström
Journal of Combinatorial Theory, Series A 120 (3), 708-721, 2013
30 2013 Rainbow Matchings of size\delta (G) in Properly Edge-colored Graphs J Diemunsch, M Ferrara, A Lo, C Moffatt, F Pfender, PS Wenger
The Electronic Journal of Combinatorics 19 (2), #P52, 2012
29 * 2012 On-line Ramsey numbers of paths and cycles J Cyman, T Dzido, J Lapinskas, A Lo
The Electronic Journal of Combinatorics 22 (1), #P1.15, 2015
28 2015 Proof of the B Csaba, D Kühn, A Lo, D Osthus, A Treglown
arXiv preprint arXiv:1401.4159, 2014
26 2014 Perfect matchings in 3-partite 3-uniform hypergraphs A Lo, K Markström
Journal of Combinatorial Theory, Series A 127, 22-57, 2014
23 2014 A note on large rainbow matchings in edge-coloured graphs A Lo, TS Tan
Graphs and Combinatorics 30 (2), 389-393, 2014
20 2014 
Daniela KuhnUniversity of BirminghamEmail verificata su bham.ac.uk