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 2017 · math.COShow all

3 papers · 2 filters

math.CO2017★ 7 cited

An asymptotic bound for the strong chromatic number

Allan Lo, Nicolás Sanhueza-Matamala

The strong chromatic number $χ_{s} (G)$ of a graph $G$ on $n$ vertices is the least number $r$ with the following property: after adding $r ⌈ n / r ⌉ - n$ isolated ve…

math.CO2017★ 22 cited

Hypergraph $F$ -designs for arbitrary $F$

Stefan Glock, Daniela Kühn, Allan Lo +1

We solve the existence problem for $F$ -designs for arbitrary $r$ -uniform hypergraphs $F$ . In particular, this shows that, given any $r$ -uniform hypergraph $F$ , the trivially necess…

math.CO2017★ 8 cited

Covering and tiling hypergraphs with tight cycles

Jie Han, Allan Lo, Nicolás Sanhueza-Matamala

Given $3 \leq k \leq s$ , we say that a $k$ -uniform hypergraph $C_{s}^{k}$ is a tight cycle on $s$ vertices if there is a cyclic ordering of the vertices of $C_{s}^{k}$ such that every $k$ …

An asymptotic bound for the strong chromatic number

Hypergraph F-designs for arbitrary F

Covering and tiling hypergraphs with tight cycles

Hypergraph $F$ -designs for arbitrary $F$