activity
20052008
most citedThe order of the largest complete minor in a random graph

2 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2007Show all

3 papers · 1 filter

math.CO2007

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…

math.CO2007★ 2 cited

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…

math.CO2007★ 1 cited

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…