2 citations · 3 across the 5 of their papers we have counts for
6 papers
Minors in random regular graphs
N. Fountoulakis, D. Kühn, D. Osthus
We show that there is a constant c>0 so that for any fixed r which is at least 3 a.a.s. an r-regular graph on n vertices contains a complete graph on c n^{1/2} vertices as a minor.…
k-Ordered Hamilton cycles in digraphs
Daniela Kühn, Deryk Osthus, Andrew Young
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k dist…
The order of the largest complete minor in a random graph
N. Fountoulakis, D. Kühn, D. Osthus
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge prob…
Linkedness and ordered cycles in digraphs
Daniela Kühn, Deryk Osthus
The minimum semi-degree of a digraph D is the minimum of its minimum outdegree and its minimum indegree. We show that every sufficiently large digraph D with minimum semi-degree at…
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…
Maximizing several cuts simultaneously
Daniela Kuehn, Deryk Osthus
Consider two graphs G_1 and G_2 on the same vertex set V and suppose that G_i has m_i edges. Then there is a bipartition of V into two classes A and B so that for both i=1,2 the nu…