81 citations · 836 across the 70 of their papers we have counts for
5 papers · 1 filter
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…
Optimal packings of bounded degree trees
Felix Joos, Jaehoon Kim, Daniela Kühn +1
We prove that if is a sequence of bounded degree trees so that has vertices, then has a decomposition into . This shows that the tr…
A blow-up lemma for approximate decompositions
Jaehoon Kim, Daniela Kühn, Deryk Osthus +1
We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our result…
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…