Allan Lo

activity

20182025

collaborators

Showing 2024 · math.COShow all

4 papers · 2 filters

math.CO2024

Simultaneous edge-colourings

Simona Boyadzhiyska, Richard Lang, Allan Lo +1

We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_{1}, \dots, G_{k}$ with few colours. We obtain asymptotically optimal bou…

math.CO2024

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree

Yihan Chen, Jialin He, Allan Lo +3

In 1975 Bollobás, Erdős, and Szemerédi asked what minimum degree guarantees an octahedral subgraph $K_{3} (2)$ in any tripartite graph $G$ with $n$ vertices in each vertex class. We s…

math.CO2024

Towards an edge-coloured Corrádi--Hajnal theorem

Allan Lo, Ella Williams

A classical result of Corrádi and Hajnal states that every graph $G$ on $n$ vertices with $n \in 3 N$ and $δ (G) \geq 2 n /3$ contains a perfect triangle-tiling, i.e.,\ a spanni…

math.CO2024

Polynomial bounds for monochromatic tight cycle partition in $r$ -edge-coloured $K_{n}^{(k)}$

Debmalya Bandyopadhyay, Allan Lo

Let $K_{n}^{(k)}$ be the complete $k$ -graph on $n$ vertices. A $k$ -uniform tight cycle is a $k$ -graph with its vertices cyclically ordered so that every $k$ consecutive vertices form…

Simultaneous edge-colourings

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree

Towards an edge-coloured Corrádi--Hajnal theorem

Polynomial bounds for monochromatic tight cycle partition in r-edge-coloured Kn(k)​

Polynomial bounds for monochromatic tight cycle partition in $r$ -edge-coloured $K_{n}^{(k)}$