Research output per year
Research output per year
Search results
-
2024
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
Bal, D., DeBiasio, L. & Lo, A., Aug 2024, In: European Journal of Combinatorics. 120, 14 p., 103969.Research output: Contribution to journal › Article › peer-review
Open AccessFile2 Downloads (Pure) -
Cycle decompositions in k-uniform hypergraphs
Lo, A., Piga, S. & Sanhueza Matamala, N., Jul 2024, In: Journal of Combinatorial Theory. Series B. 167, p. 55-103 49 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile13 Downloads (Pure) -
Hamilton cycles in dense regular digraphs and oriented graphs
Lo, A., Patel, V. & Yildiz, M. A., Jan 2024, In: Journal of Combinatorial Theory. Series B. 164, p. 119-160 42 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile19 Downloads (Pure) -
2023
Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
Lo, A. & Pfenninger, V., 28 Aug 2023, EUROCOMB’23. Masaryk University Press, p. 1-6 6 p. 100. (European Conference on Combinatorics, Graph Theory and Applications; no. 12).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile8 Downloads (Pure) -
Cycle Partition of Dense Regular Digraphs and Oriented Graphs
Lo, A., Patel, V. & Yildiz, M. A., 28 Aug 2023, EUROCOMB’23. Masaryk University Press, p. 1-8 8 p. 99. (European Conference on Combinatorics, Graph Theory and Applications; no. 12).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile11 Downloads (Pure) -
Tight path, what is it (Ramsey-) good for? Absolutely (almost) nothing!
Boyadzhiyska, S. & Lo, A., 28 Aug 2023, EUROCOMB’23. Masaryk University Press, p. 1-7 7 p. 26. (European Conference on Combinatorics, Graph Theory and Applications; no. 12).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile21 Downloads (Pure)