64 citations · 285 across the 44 of their papers we have counts for
4 papers · 2 filters
The existence of designs via iterative absorption: hypergraph -designs for arbitrary
Stefan Glock, Daniela Kühn, Allan Lo +1
We solve the existence problem for -designs for arbitrary -uniform hypergraphs~. This implies that given any -uniform hypergraph~, the trivially necessary divisibili…
Subgraphs with large minimum -degree in hypergraphs where almost all -degrees are large
Victor Falgas-Ravry, Allan Lo
Let be an -uniform hypergraph on vertices such that all but at most -subsets of vertices have degree at least $p \binom{n-\ell}{r-\el…
On the decomposition threshold of a given graph
Stefan Glock, Daniela Kühn, Allan Lo +2
We study the -decomposition threshold for a given graph . Here an -decomposition of a graph is a collection of edge-disjoint copies of in which together…
Clique decompositions of multipartite graphs and completion of Latin squares
Ben Barber, Daniela Kühn, Allan Lo +2
Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fr…