A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n.In fact, we prove a far more general result, based on our recent concept of robust expansion and a new method for decomposing graphs.We show that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. This enables us to obtain numerous further results, e.g. as a special case we confirm a conjecture of Erdos on packing Hamilton cycles in random tournaments. As corollaries to the main result, we also obtain several results on packing Hamilton...
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ ...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomp...
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomp...
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomp...
Abstract. A long-standing conjecture of Kelly states that every regular tour-nament on n vertices ca...
Abstract. In a recent paper, we showed that every sufficiently large regular digraph G on n vertices...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
This thesis contains four results in extremal graph theory relating to the recent notion of robust e...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from ...
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ ...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomp...
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomp...
A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomp...
Abstract. A long-standing conjecture of Kelly states that every regular tour-nament on n vertices ca...
Abstract. In a recent paper, we showed that every sufficiently large regular digraph G on n vertices...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
This thesis contains four results in extremal graph theory relating to the recent notion of robust e...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from ...
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ ...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...