Allan Siu Lun Lo

Discrete Mathematics and Combinatorics · 2011–2016

A researcher in the Science corpus: 4 papers; trusts 8 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 20 citations into it; #1,271 of 2,017 by trust here, #1,552 by citations
• Computational Theory and Mathematics — 17 citations into it; #7,850 of 12,182 by trust here, #11,462 by citations
• Geometry and Topology — 13 citations into it; #4,941 of 7,422 by trust here, #6,910 by citations
• Electrical and Electronic Engineering — 11 citations into it

Whom Allan Siu Lun Lo trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Peter Keevash
2. Vojtech Rödl
3. Andrzej Rucinski
4. Richard Mycroft
5. Jozsef Balogh

Who trusts Allan Siu Lun Lo overall

1. Jie Han
2. Yi Zhao

Papers from Allan Siu Lun Lo's perspective

Ordered by how strongly the researchers Allan Siu Lun Lo trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
2. The existence of designs
3. Combinatorial theorems in sparse random sets
4. Hamilton cycles in graphs and hypergraphs: an extremal perspective
5. A Geometric Theory for Hypergraph Matching
6. Independent sets in hypergraphs
7. Extremal results for random discrete structures
8. A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
9. Counting designs
10. The existence of designs II

Their papers

• Proof of the 1-factorization and Hamilton Decomposition Conjectures (2014) — 117 citations
• $F$-factors in hypergraphs via absorption (2011) — 58 citations
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (2016) — 91 citations
• The existence of designs via iterative absorption (2016) — 103 citations