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

4 papers · 1 filter

math.CO2022

An oriented discrepancy version of Dirac's theorem

Andrea Freschi, Allan Lo

The study of graph discrepancy problems, initiated by Erdős in the 1960s, has received renewed attention in recent years. In general, given a $2$ -edge-coloured graph $G$ , one is in…

math.CO2022

Cycle decompositions in $k$ -uniform hypergraphs

Allan Lo, Simón Piga, Nicolás Sanhueza-Matamala

We show that $k$ -uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o (1)) n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions.…

math.CO2022

Hamilton Cycles in Dense Regular Digraphs and Oriented Graphs

Allan Lo, Viresh Patel, Mehmet Akif Yıldız

We prove that for every $ε > 0$ there exists $n_{0} = n_{0} (ε)$ such that every regular oriented graph on $n > n_{0}$ vertices and degree at least $(1/4 + \varepsilon)n…

math.CO2022

Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs

A. Nicholas Day, Allan Lo

The upper density of an infinite graph $G$ with $V (G) \subseteq N$ is defined as $d (G) = lim sup_{n \to \infty} ∣ V (G) \cap {1, \dots, n} ∣ / n$ . Let $K…

An oriented discrepancy version of Dirac's theorem

Cycle decompositions in k-uniform hypergraphs

Hamilton Cycles in Dense Regular Digraphs and Oriented Graphs

Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs

Cycle decompositions in $k$ -uniform hypergraphs