31 citations · 62 across the 15 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Optimal packings of Hamilton cycles in graphs of high minimum degree
Daniela Kühn, John Lapinskas, Deryk Osthus
We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree d = (1/2+a)n. For any constant a > 0, we gi…
math.CO2012★ 3 cited
Optimal covers with Hamilton cycles in random graphs
Dan Hefetz, Daniela Kühn, John Lapinskas +1
A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest pack…