81 citations · 836 across the 70 of their papers we have counts for
3 papers · 2 filters
Edge-disjoint Hamilton cycles in graphs
Demetres Christofides, Daniela Kühn, Deryk Osthus
In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every α> 0, every sufficiently large graph on n vertices with minimum degree…
Hamilton decompositions of regular tournaments
Daniela Kühn, Deryk Osthus, Andrew Treglown
We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each η>0 every regular tourname…
Hamilton l-cycles in uniform hypergraphs
Daniela Kühn, Richard Mycroft, Deryk Osthus
We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that…