an undirected analogue of our result on robust outexpanders;
best possible bounds on the size of an optimal packing of edge-disjoint Hamilton cycles in a graph of minimum degree 未 for a large range of values for 未.
a similar result for digraphs of given minimum semidegree;
an approximate version of a conjecture of Nash-Williams on Hamilton decompositions of dense regular graphs;
a verification of the 鈥榲ery dense鈥?case of a conjecture of Frieze and Krivelevich on packing edge-disjoint Hamilton cycles in random graphs;
a proof of a conjecture of Erd艖s on the size of an optimal packing of edge-disjoint Hamilton cycles in a random tournament.