9 citations · 25 across the 13 of their papers we have counts for
5 papers · 2 filters
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn +1
Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for…
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn +1
Chvátal, Rödl, Szemerédi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hyperg…
Perfect packings with complete graphs minus an edge
Oliver Cooley, Daniela Kühn, Deryk Osthus
Let K_r^- denote the graph obtained from K_r by deleting one edge. We show that for every integer r\ge 4 there exists an integer n_0=n_0(r) such that every graph G whose order n\ge…
A note on complete subdivisions in digraphs of large outdegree
Daniela Kühn, Deryk Osthus, Andrew Young
Mader conjectured that for all k there is an integer d(k) such that every digraph of minimum outdegree at least d(k) contains a subdivision of a transitive tournament of order k. I…
The minimum degree threshold for perfect graph packings
Daniela Kühn, Deryk Osthus
Let H be any graph. We determine (up to an additive constant) the minimum degree of a graph G which ensures that G has a perfect H-packing (also called an H-factor). More precisely…