64 citations · 285 across the 44 of their papers we have counts for
6 papers · 1 filter
Minimum codegree threshold for -factors
Allan Lo, Klas Markström
Given hypergraphs H and F, an F-factor in H is a spanning subgraph consisting of vertex disjoint copies of F. Let K_4^3-e denote the 3-uniform hypergraph on 4 vertices with 3 edges…
A note on rainbow matchings in properly edge-coloured graphs
Allan Lo
A rainbow matching in an edge-coloured graph is a matching such that its edges have distinct colours. We show that every properly edge-coloured graph with $|G| \ge (9δ(G) -5)/2…
Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs
Jennifer Diemunsch, Michael Ferrara, Casey Moffatt +2
A {\it rainbow matching} in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function f(δ) such that a properly edge-colore…
A multipartite version of the Hajnal-Szemerédi theorem for graphs and hypergraphs
Allan Lo, Klas Markström
A perfect -matching in a graph is a spanning subgraph consisting of vertex disjoint copies of . A classic theorem of Hajnal and Szemerédi states that if is a grap…
-factors in hypergraphs via absorption
Allan Lo, Klas Markström
Given integers and a -graph with divisible by , define to be the smallest integer such that every -graph of order $n…
Perfect matchings in 3-partite 3-uniform hypergraphs
Allan Lo, Klas Markström
Let be a -partite -uniform hypergraph, i.e. a -uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition clas…