Substructures in large graphs
The first problem we address concerns Hamilton cycles. Suppose G is a large digraph in which every vertex has in- and outdegree at least |G|/2. We show that G contains every orientation of a Hamilton cycle except, possibly, the antidirected one. The antidirected case was settled by DeBiasio and Moll...
| Main Author: | |
|---|---|
| Published: |
University of Birmingham
2017
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.704861 |