Abstract
A Hamilton cycle in a digraph is a cycle passing through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this, is that there is no general tool for finding Hamilton cycles in directed graphs comparable to the so called Posá ‘rotation-extension’ technique for the undirected analogue. Here, we present a general and a very simple method, using known results, to attack problems of packing, counting and covering Hamilton cycles in random directed graphs, for every edge-probability p>logC(n)/n. Our results are asymptotically optimal with respect to all parameters and apply equally well to the undirected case.
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.
