Counting and packing Hamilton cycles in dense graphs and oriented graphs

We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly cn-regular oriented graph on n vertices with c > 3/8 contains (cn/e)(1 + o(1)) directed Hamilton cycles. This is an extension of a result of Cuckler, who settled an old conjecture of Thomassen about the number of Hamilton cycles in regular tournaments. We also prove that every graph G on n vertices of minimum degree at least (1/2 + ε)n contains at least (1− ε)regeven(G)/2 edge-disjoint Hamilton cycles, where regeven(G) is the maximum even degree of a spanning regular subgraph of G. This establishes an approximate version of a conjecture of Kühn, Lapinskas and Osthus.