Hostname: page-component-6bb9c88b65-2jdt9 Total loading time: 0 Render date: 2025-07-20T03:39:55.098Z Has data issue: false hasContentIssue false
  • English
  • Français

Hamilton Cycles in Random Regular Digraphs

Published online by Cambridge University Press:  12 September 2008

Colin Cooper ,
Alan Frieze  and
Michael Molloy
Colin Cooper
Affiliation:
School of Mathematical Sciences, University of North London, London, U.K.
Alan Frieze
Affiliation:
Department of Mathematics, Carnegie-Mellon University, Pittsburgh PA 15213, U.S.A.
Michael Molloy
Affiliation:
Department of Mathematics, Carnegie-Mellon University, Pittsburgh PA 15213, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove that almost every r-regular digraph is Hamiltonian for all fixed r ≥ 3.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 3 , Issue 1 , March 1994 , pp. 39 - 49
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labelled graphs with given degree sequences, Journal of Combinatorial Theory (A) 24 296–307.CrossRefGoogle Scholar
[2]Bollobás, B. (1983) Almost all regular graphs are Hamiltonian. European Journal of Combinatorics 4 97–106.CrossRefGoogle Scholar
[3]Bollobás, B. (1983) Random graphs, Academic Press.Google Scholar
[4]Cooper, C. and Frieze, A. M. (to appear) Hamilton cycles in a class of random digraphs.Google Scholar
[5]Fenner, T. I. and Frieze, A. M. (1984) Hamiltonian cycles in random regular graphs, Journal of Combinatorial Theory B 37 103–112.CrossRefGoogle Scholar
[6]Frieze, A. M. (1988) Finding hamilton cycles in sparse random graphs, Journal of Combinatorial Theory B 44 230–250.CrossRefGoogle Scholar
[7]Kolchin, V. F. (1986) Random mappings, Optimization Software Inc., New York.Google Scholar
[8]Robinson, R. W. and Wormald, N. C. (1992) Almost all cubic graphs are Hamiltonian, Random Structures and Algorithms 3 117–126.CrossRefGoogle Scholar
[9]Robinson, R. W. and Wormald, N. C. (to appear) Almost all regular graphs are Hamiltonian, Random Structures and Algorithms.Google Scholar