Allan Lo

activity

20182025

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

From finding a spanning subgraph $H$ to an $H$ -factor

Allan Lo

A typical Dirac-type problem in extremal graph theory is to determine the minimum degree threshold for a graph $G$ to have a spanning subgraph $H$ , e.g. the Dirac theorem. A natura…

math.CO2025

Embedding loose trees in $k$ -uniform hypergraphs

Yaobin Chen, Allan Lo

A classical result of Komlós, Sárközy and Szemerédi shows that every large $n$ -vertex graph with minimum degree at least $(1/2 + γ) n$ contains all spanning trees of bounded degree. W…

From finding a spanning subgraph H to an H-factor

Embedding loose trees in k-uniform hypergraphs

From finding a spanning subgraph $H$ to an $H$ -factor

Embedding loose trees in $k$ -uniform hypergraphs