Research output per year
Research output per year
Research output
- 13 Article
- 13 results
Search results
-
An asymptotic bound for the strong chromatic number
Lo, A. & Sanhueza Matamala, N., Sept 2019, In: Combinatorics, Probability and Computing. 28, 5, p. 768-776 9 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)229 Downloads (Pure) -
Codegree Turán density of complete $r$-uniform hypergraphs
Lo, A. & Zhao, Y., 2018, In: SIAM Journal on Discrete Mathematics. 32, 2, p. 1154-1158Research output: Contribution to journal › Article › peer-review
Open AccessFile185 Downloads (Pure) -
Covering and tiling hypergraphs with tight cycles
Han, J., Lo, A. & Sanhueza-Matamala, N., 13 Oct 2020, In: Combinatorics, Probability and Computing. 0, p. 1-36Research output: Contribution to journal › Article › peer-review
Open AccessFile124 Downloads (Pure) -
Density of monochromatic infinite paths
Lo, A., Sanhueza-Matamala, N. & Wang, G., 2 Nov 2018, In: Electronic Journal of Combinatorics. 25, 4, P4.29.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)121 Downloads (Pure) -
Exact minimum codegree threshold for K-4-factors
Han, J., Lo, A., Treglown, A. & Zhao, Y., 4 Aug 2017, In: Combinatorics, Probability and Computing. 26, p. 856-885Research output: Contribution to journal › Article › peer-review
Open AccessFile5 Citations (Scopus)129 Downloads (Pure) -
Long properly coloured cycles in edge-coloured graphs
Lo, A., 1 Mar 2019, In: Journal of Graph Theory. 90, 3, p. 416-442 27 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)173 Downloads (Pure) -
Monochromatic cycle partitions in random graphs
Lang, R. & Lo, A., 14 Aug 2020, (E-pub ahead of print) In: Combinatorics, Probability and Computing.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)170 Downloads (Pure) -
On a conjecture of Erdős on locally sparse Steiner triple systems
Glock, S., Kuhn, D., Lo, A. & Osthus, D., 28 Apr 2020, In: Combinatorica. 40, 3, p. 363-403 41 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)130 Downloads (Pure) -
Spanning trees with few branch vertices
DeBiasio, L. & Lo, A., 22 Aug 2019, In: SIAM Journal on Discrete Mathematics. 33, 3, p. 1503–1520 18 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)141 Downloads (Pure) -
Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large
Falgas-Ravry, V. & Lo, A., 27 Apr 2018, In: The Electronic Journal of Combinatorics. 25, 2, P2.18.Research output: Contribution to journal › Article › peer-review
Open AccessFile29 Downloads (Pure) -
The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F
Glock, S., Kuhn, D., Lo, A. & Osthus, D., 28 Feb 2020, (Accepted/In press) In: Memoirs of the American Mathematical Society.Research output: Contribution to journal › Article › peer-review
-
Transitive tournament tilings in oriented graphs with large minimum total degree
DeBiasio, L., Lo, A., Molla, T. & Treglown, A., 22 Feb 2021, In: SIAM Journal on Discrete Mathematics. 35, 1, p. 250–266 17 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile170 Downloads (Pure) -
Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
Day, N. & Lo, A., May 2023, In: European Journal of Combinatorics. 110, 8 p., 103625.Research output: Contribution to journal › Article › peer-review
Open AccessFile