Allan Lo

1.0k total citations
46 papers, 321 citations indexed

About

Allan Lo is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Allan Lo has authored 46 papers receiving a total of 321 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Discrete Mathematics and Combinatorics, 40 papers in Computational Theory and Mathematics and 24 papers in Electrical and Electronic Engineering. Recurrent topics in Allan Lo's work include Limits and Structures in Graph Theory (42 papers), Advanced Graph Theory Research (36 papers) and graph theory and CDMA systems (24 papers). Allan Lo is often cited by papers focused on Limits and Structures in Graph Theory (42 papers), Advanced Graph Theory Research (36 papers) and graph theory and CDMA systems (24 papers). Allan Lo collaborates with scholars based in United Kingdom, Sweden and United States. Allan Lo's co-authors include Klas Markström, Deryk Osthus, Daniela Kühn, Andrew Treglown, Béla Csaba, Yi Zhao, Stefan Glock, Richard Montgomery, Jie Han and Michael Ferrara and has published in prestigious journals such as Advances in Mathematics, Memoirs of the American Mathematical Society and Proceedings of the London Mathematical Society.

In The Last Decade

Allan Lo

40 papers receiving 294 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Allan Lo United Kingdom	11	285	253	141	108	10	46	321
Yury Person Germany	10	276 1.0×	238 0.9×	68 0.5×	169 1.6×	15 1.5×	40	304
Zi‐Xia Song United States	13	241 0.8×	308 1.2×	48 0.3×	72 0.7×	5 0.5×	45	395
Andrew Treglown United Kingdom	11	344 1.2×	295 1.2×	133 0.9×	164 1.5×	9 0.9×	44	378
Juan José Montellano‐Ballesteros Mexico	8	185 0.6×	213 0.8×	47 0.3×	106 1.0×	9 0.9×	42	250
André Kündgen United States	10	199 0.7×	292 1.2×	77 0.5×	80 0.7×	14 1.4×	30	329
Brendan Nagle United States	11	405 1.4×	342 1.4×	65 0.5×	240 2.2×	9 0.9×	31	430
Choongbum Lee United States	11	211 0.7×	189 0.7×	41 0.3×	127 1.2×	11 1.1×	25	245
Mirko Horňák Slovakia	13	141 0.5×	405 1.6×	120 0.9×	82 0.8×	3 0.3×	52	452
Keresztély Corrádi Hungary	5	165 0.6×	184 0.7×	106 0.8×	62 0.6×	15 1.5×	18	240
Hiệp Hàn Chile	7	203 0.7×	156 0.6×	81 0.6×	120 1.1×	6 0.6×	21	221

Countries citing papers authored by Allan Lo

Since Specialization

Citations

This map shows the geographic impact of Allan Lo's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Allan Lo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Allan Lo more than expected).

Fields of papers citing papers by Allan Lo

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Allan Lo. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Allan Lo. The network helps show where Allan Lo may publish in the future.

Co-authorship network of co-authors of Allan Lo

This figure shows the co-authorship network connecting the top 25 collaborators of Allan Lo. A scholar is included among the top collaborators of Allan Lo based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Allan Lo. Allan Lo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lo, Allan, et al.. (2025). The Ramsey Number for 4-Uniform Tight Cycles. SIAM Journal on Discrete Mathematics. 39(1). 361–387.

Lo, Allan, et al.. (2024). An oriented discrepancy version of Dirac's theorem. Journal of Combinatorial Theory Series B. 169. 338–351. 1 indexed citations

Glock, Stefan, Daniela Kühn, Allan Lo, & Deryk Osthus. (2023). The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹. Memoirs of the American Mathematical Society. 284(1406). 6 indexed citations

Lo, Allan, et al.. (2023). Towards Lehel's Conjecture for 4-Uniform Tight Cycles. The Electronic Journal of Combinatorics. 30(1). 2 indexed citations

Lo, Allan, et al.. (2023). Hamilton cycles in dense regular digraphs and oriented graphs. Journal of Combinatorial Theory Series B. 164. 119–160.

Lo, Allan, et al.. (2018). Subgraphs with Large Minimum $\ell$-Degree in Hypergraphs where Almost All $\ell$-Degrees are Large. The Electronic Journal of Combinatorics. 25(2). 2 indexed citations

Kühn, Daniela, et al.. (2017). Fractional clique decompositions of dense graphs and hypergraphs. Journal of Combinatorial Theory Series B. 127. 148–186. 7 indexed citations

Balogh, József, et al.. (2017). Transitive triangle tilings in oriented graphs. Journal of Combinatorial Theory Series B. 124. 64–87. 2 indexed citations

Kühn, Daniela, et al.. (2017). Clique decompositions of multipartite graphs and completion of Latin squares. Journal of Combinatorial Theory Series A. 151. 146–201. 10 indexed citations

10.

Csaba, Béla, Daniela Kühn, Allan Lo, Deryk Osthus, & Andrew Treglown. (2016). Proof of the 1-factorization and Hamilton Decomposition Conjectures. Memoirs of the American Mathematical Society. 244(1154). 0–0. 28 indexed citations

11.

Kühn, Daniela, et al.. (2015). Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. Journal of Combinatorial Theory Series B. 121. 85–145. 3 indexed citations

12.

Kühn, Daniela, Allan Lo, Deryk Osthus, & Andrew Treglown. (2014). Proof of the 1-factorization and Hamilton decomposition conjectures I: the two cliques case. arXiv (Cornell University). 4 indexed citations

13.

Lo, Allan & Klas Markström. (2014). Perfect matchings in 3-partite 3-uniform hypergraphs. Journal of Combinatorial Theory Series A. 127. 22–57. 8 indexed citations

14.

Lo, Allan. (2014). A note on the minimum size ofk-rainbow-connected graphs. Discrete Mathematics. 331. 20–21. 7 indexed citations

15.

Lo, Allan & Klas Markström. (2014). $$F$$ F -Factors in Hypergraphs Via Absorption. Graphs and Combinatorics. 31(3). 679–712. 36 indexed citations

16.

Lo, Allan. (2014). An Edge-Colored Version of Dirac's Theorem. SIAM Journal on Discrete Mathematics. 28(1). 18–36. 22 indexed citations

17.

Lo, Allan. (2013). A Dirac Type Condition for Properly Coloured Paths and Cycles. Journal of Graph Theory. 76(1). 60–87. 18 indexed citations

18.

Lo, Allan & Klas Markström. (2013). Minimum codegree threshold for(K43−e)-factors. Journal of Combinatorial Theory Series A. 120(3). 708–721. 14 indexed citations

19.

Lo, Allan & Klas Markström. (2012). {l}-degree Tur\'an density. arXiv (Cornell University). 3 indexed citations

20.

Lo, Allan. (2010). Constrained Ramsey numbers for rainbow matching. Journal of Graph Theory. 67(2). 91–95. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact