Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs
Combinatorics
2009-08-06 v2
Abstract
We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\"aggkvist and Thomason.
Cite
@article{arxiv.0907.3358,
title = {Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs},
author = {Luke Kelly},
journal= {arXiv preprint arXiv:0907.3358},
year = {2009}
}