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 2012Show all

4 papers · 1 filter

math.CO2012★ 1 cited

Properly coloured Hamiltonian cycles in edge-coloured complete graphs

Allan Lo

Let $K_{n}^{c}$ be an edge-coloured complete graph on $n$ vertices. Let $Δ_{mon} (K_{n}^{c})$ denote the largest number of edges of the same colour incident with a vertex of $K_{n}^{c}$ . A…

math.CO2012

An edge-coloured version of Dirac's theorem

Allan Lo

Let $G$ be an edge-coloured graph. The minimum colour degree $δ^{c} (G)$ of $G$ is the largest integer $k$ such that, for every vertex $v$ , there are at least $k$ distinct colours o…

math.CO2012

$ℓ$ -degree Turán density

Allan Lo, Klas Markström

Let $H_{n}$ be a $k$ -graph on $n$ vertices. For $0 \leq ℓ < k$ and an $ℓ$ -subset $T$ of $V (H_{n})$ , define the degree $° (T)$ of $T$ to be the number of $(k - ℓ)$ -subsets~ $S$ such…

math.CO2012

A note on large rainbow matchings in edge-coloured graphs

Allan Lo, Ta Sheng Tan

A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colour…

Properly coloured Hamiltonian cycles in edge-coloured complete graphs

An edge-coloured version of Dirac's theorem

ℓ-degree Turán density

A note on large rainbow matchings in edge-coloured graphs

$ℓ$ -degree Turán density