Abstract
AbstractWe propose the following extension of Dirac's theorem: if is a graph with vertices and minimum degree , then in every orientation of there is a Hamilton cycle with at least edges oriented in the same direction. We prove an approximate version of this conjecture, showing that minimum degree guarantees a Hamilton cycle with at least edges oriented in the same direction. We also study the analogous problem for random graphs, showing that if the edge probability is above the Hamiltonicity threshold, then, with high probability, in every orientation of there is a Hamilton cycle with edges oriented in the same direction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
