A. Lo

activity

20102023

most citedEdge-decompositions of graphs with high minimum degree

64 citations · 285 across the 44 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015★ 26 cited

Fractional Clique Decompositions of Dense Graphs and Hypergraphs

Ben Barber, Daniela Kühn, Allan Lo +2

Our main result is that every graph $G$ on $n \geq 1 0^{4} r^{3}$ vertices with minimum degree $δ (G) \geq (1 - 1/1 0^{4} r^{3/2}) n$ has a fractional $K_{r}$ -decomposition. Combining this res…

math.CO2015

Hamilton cycles in sparse robustly expanding digraphs

Allan Lo, Viresh Patel

The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and ot…

math.CO2015★ 7 cited

Existences of rainbow matchings and rainbow matching covers

Allan Lo

Let $G$ be an edge-coloured graph. A rainbow subgraph in $G$ is a subgraph such that its edges have distinct colours. The minimum colour degree $δ^{c} (G)$ of $G$ is the smallest numb…

math.CO2015★ 11 cited

A note on the minimum size of $k$ -rainbow connected graphs

Allan Lo

An edge-coloured graph $G$ is rainbow connected if there exists a rainbow path between any two vertices. A graph $G$ is said to be $k$ -rainbow connected if there exists an edge-col…

Fractional Clique Decompositions of Dense Graphs and Hypergraphs

Hamilton cycles in sparse robustly expanding digraphs

Existences of rainbow matchings and rainbow matching covers

A note on the minimum size of k-rainbow connected graphs

A note on the minimum size of $k$ -rainbow connected graphs