Publications

Preprints

  1. Louis DeBiasio and Allan Lo, Spanning trees with few branch vertices, ArXiv version

  2. Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus, Hypergraph F-designs for arbitrary F, ArXiv version

  3. Jie Han, Allan Lo and Nicolás Sanhueza-Matamala, Covering and tiling hypergraphs with tight cycles, ArXiv version

  4. Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus, The existence of designs via iterative absorption, PDF, ArXiv version

  5. Victor Falgas-Ravry and Allan Lo, High codegree subgraphs in weakly quasirandom 3-graphs, ArXiv version

  6. Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery and Deryk Osthus, On the decomposition threshold of a given graphs, PDF, ArXiv version

  7. Allan Lo and Viresh Patel, Hamilton cycles in sparse robustly expanding digraphs, PDF, ArXiv version


Accepted

  1. Jie Han, Allan Lo, Andrew Treglown and Yi Zhao, Exact minimum codegree threshold for $K_4^-$-factors, Combinatorics, Probability and Computing, to appear, ArXiv version


Published

  1. 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

  2. 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

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

  4. 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

  5. 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, PDF

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

  7. 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

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

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

  10. 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.

  11. 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.

  12. 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.

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

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

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

  16. 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.

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

  18. 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.

  19. 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.

  20. 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.

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

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

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


Updated 22 September 2017