zbMATH — the first resource for mathematics

Hamilton cycles in oriented graphs. (English) Zbl 0795.05087
Author’s abstract: It is shown that an oriented graph of order $$n$$ whose every indegree and outdegree is at least $$cn$$ is hamiltonian if $$c \geq {1 \over 2} - 2^{-15}$$ but need not be if $$c<{3 \over 8}$$.

MSC:
 05C45 Eulerian and Hamiltonian graphs 05C20 Directed graphs (digraphs), tournaments 05C35 Extremal problems in graph theory
Full Text:
References:
 [1] Thomassen, London Math. Soc. Lecture Notes 38 pp 211– (1979) [2] DOI: 10.1112/plms/s3-42.2.231 · Zbl 0454.05029 · doi:10.1112/plms/s3-42.2.231 [3] DOI: 10.1002/jgt.3190050204 · Zbl 0458.05041 · doi:10.1002/jgt.3190050204 [4] Bondy, Graph Theory with Applications (1976) · Zbl 1226.05083 · doi:10.1007/978-1-349-03521-2 [5] DOI: 10.1007/BF02122681 · Zbl 0681.05036 · doi:10.1007/BF02122681 [6] Häggkvist, 9th British Combinatorial Conference (1983) [7] Hajnal, Colloq. Math. Soc. J. Bolyai 4 pp 601– (1970)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.