Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs
Abstract
We use a randomised embedding method to prove that for all α>0 any sufficiently large oriented graph G with minimum in-degree and out-degree δ+(G),δ-(G)≥ (3/8+α)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\"aggkvist and Thomason.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.