Up a level |
Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hng, Eng Keat, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Davies, Ewan (2022) An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195. 394 - 403. ISSN 1877-0509
Cooley, Oliver, Garbe, Frederik, Hng, Eng Keat, Kang, Mihyun, Sanhueza-Matama, Nicolás and Zalla, Julian (2021) Longest paths in random hypergraphs. SIAM Journal on Discrete Mathematics, 35 (4). 2430 – 2458. ISSN 0895-4801
Aranda, Andrés, Bradley-Williams, David, Hng, Eng Keat, Hubička, Jan, Karamanlis, Miltiadis, Kompatscher, Michael, Konečný, Matěj and Pawliuk, Micheal (2021) Completing graphs to metric spaces. Contributions to Discrete Mathematics, 16 (2). 71 - 89. ISSN 1715-0868