Publications

Preprints

  1. Allan Lo and Vincent Pfenninger , Towards Lehel's conjecture for 4-uniform tight cycles, ArXiv version

  2. Antonió Girão , Bertille Granet, Daniela Kühn, Allan Lo and Deryk Osthus, Path decompositions of tournaments, ArXiv version


Accepted

  1. Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus, The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F, Memoirs of the American Mathematical Society ArXiv version


Published

  1. Jie Han, Allan Lo and Nicolás Sanhueza-Matamala, Covering and tiling hypergraphs with tight cycles, Combinatorics, Probability and Computing, 30 (2021), 288-329, ArXiv version

  2. Louis DeBiasio, Allan Lo, Theodore Molla and Andrew Treglown, Transitive tournament tilings in oriented graphs with large minimum total degree, SIAM Journal on Discrete Mathematics, 35(1), 250-266, ArXiv version

  3. Richard Lang and Allan Lo, Monochromatic cycle partitions in random graphs, Combinatorics, Probability and Computing, 30 (2021), 136-152, ArXiv version

  4. Allan Lo, Viresh Patel, Jozef Skokan and John Talbot, Decomposing tournaments into paths, Proceedings of the London Mathematical Society, 121 (2020), 426-461, ArXiv version

  5. Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery and Deryk Osthus, Minimalist designs, Random Structures & Algorithm, 57 (2020), 47-63, ArXiv version

  6. Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus, On a conjecture of Erdős on locally sparse Steiner triple systems, Combinatorica 40 (2020), 363-403 ArXiv version

  7. Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery and Deryk Osthus, On the decomposition threshold of a given graphs, Journal Combinatorial Theory Series B, 139 (2019), 47-127, PDF, ArXiv version

  8. Allan Lo and Nicolás Sanhueza-Matamala, An asymptotic bound for the strong chromatic number, Combinatorics, Probability and Computing, 28 (2019), 768-776, ArXiv version

  9. Louis DeBiasio and Allan Lo, Spanning trees with few branch vertices, SIAM Journal on Discrete Mathematics, 33 (2019), 1503-1520, ArXiv version

  10. Allan Lo, Long properly coloured cycles in edge-coloured graphs, Journal of Graph Theory, 90 (2019), 416-442, ArXiv version

  11. Allan Lo, Nicolás Sanhueza-Matamala and Guanghui Wang, Density of monochromatic infinite paths, Electronic Journal of Combinatorics, 25 (2018), #P4.29, ArXiv version

  12. Allan Lo and Viresh Patel, Hamilton cycles in sparse robustly expanding digraphs, Electronic Journal of Combinatorics, 25 (2018) #P3.44, ArXiv version

  13. Allan Lo and Yi Zhao, Codegree Turán density of complete r-uniform hypergraphs, SIAM Journal on Discrete Mathematics, 32 (2018), 1154-1158, ArXiv version

  14. Victor Falgas-Ravry and Allan Lo, Subgraphs with large minimum \ell-degree in hypergraphs where almost all \ell-degrees are large, Electronic Journal of Combinatorics, 25 (2018), #P2.18, ArXiv version

  15. Jie Han, Allan Lo, Andrew Treglown and Yi Zhao, Exact minimum codegree threshold for $K_4^-$-factors, Combinatorics, Probability and Computing, 26 (2017), 856-885, ArXiv version

  16. Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery and Deryk Osthus, Fractional clique decompositions of dense graphs and hypergraphs, Journal Combinatorial Theory Series B, 127 (2017), 148-186, PDF, ArXiv version

  17. Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus and Amelia Taylor, Clique decompositions of multipartite graphs and completion of Latin squares, Journal Combinatorial Theory Series A, 151 (2017), 146-201, PDF, ArXiv version

  18. Jozsef Balogh, Allan Lo and Theodore Molla, Transitive triangle tilings in oriented graphs, Journal Combinatorial Theory Series B, 124 (2017), 64-87, ArXiv version

  19. Béla Csaba, Daniela Kühn, Allan Lo, Deryk Osthus and Andrew Treglown, Proof of the 1-factorization and Hamilton decomposition conjectures, Memoirs of the American Mathematical Society, 224 (2016), monograph 1154, ArXiv version, PDF

  20. Daniela Kühn, Allan Lo, Deryk Osthus and Katherine Staden, Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs, Journal Combinatorial Theory Series B, 121 (2016), 85-145

  21. Allan Lo, Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Combinatorica, 36 (2016), 471-492, ArXiv version

  22. Ben Barber, Daniela Kühn, Allan Lo and Deryk Osthus, Edge-decompositions of graphs with high minimum degree, Advances in Mathematics, 288 (2016), 337-385, PDF, ArXiv version

  23. Allan Lo, Existences of rainbow matchings and rainbow matching covers, Discrete Mathematics, 338 (2015), 2119-2124.

  24. Allan Lo and Klas Markström, F-factors in hypergraphs via absorption, Graphs and Combinatorics, 31 (2015), 679-712, ArXiv version.

  25. Daniela Kühn, Allan Lo, Deryk Osthus and Katherine Staden, The robust component structure of dense regular graphs and applications, Proceedings of the London Mathematical Society, 110 (2015), 19-56, ArXiv version PDF.

  26. Joanna Cyman, Tomasz Dzido, John Lapinskas and Allan Lo, On-line Ramsey numbers for paths and cycles, Electronic Journal of Combinatorics, 22 (2015), #P1.15, ArXiv version.

  27. Allan Lo and Klas Markström, Perfect matchings in 3-partite 3-uniform hypergraphs, Journal Combinatorial Theory Series A 127 (2014), 22-57, ArXiv version.

  28. Allan Lo and Klas Markström, l-degree Turan density, SIAM Journal on Discrete Mathematics 28 (2014), 1214-1225, ArXiv version.

  29. Allan Lo, A note on the minimum size of k-rainbow-connected graphs, Discrete Mathematics 331 (2014), 20-21.

  30. Allan Lo, A Dirac type condition for properly coloured paths and cycles, Journal of Graph Theory 76 (2014), 60-87, ArXiv version.

  31. Allan Lo and Ta Sheng Tan, A note on large rainbow matchings in edge-coloured graphs, Graphs and Combinatorics 30 (2014), 389-393, ArXiv version.

  32. Allan Lo, An edge-coloured version of Dirac's Theorem, SIAM Journal on Discrete Mathematics 28 (2014), 18-36, ArXiv version, PDF.

  33. Allan Lo and Klas Markström, Minimum codegree threshold for (K_4^3-e)-factors, Journal Combinatorial Theory Series A 120 (2013), 708-721, ArXiv version.

  34. Allan Lo and Klas Markström, A multipartite version of the Hajnal-Szemerédi theorem for graphs and hypergraphs, Combinatorics, Probability and Computing 22 (2013), 97-111, ArXiv version.

  35. Jennifer Diemunsch, Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender and Paul Wenger, Rainbow matchings of size \delta(G) in properly edge-colored graphs, Electronic Journal of Combinatorics 19 (2012), #P52, PDF.

  36. Allan Lo, Cliques in graphs with bounded minimum degree, Combinatorics, Probability and Computing 21 (2012) 457-482, PDF.

  37. Allan Lo, Constrained Ramsey numbers for rainbow matching, Journal of Graph Theory 67 (2011), 91-95, Journal version.

  38. Allan Lo Triangles in regular graphs with density below one half, Combinatorics, Probability and Computing 18 (2009), 435-440, Journal version.