Hamilton cycles in random graphs and directed graphs

Random Structures and Algorithms

Volumn 16, Issue 4, 2000, Pages 369-401

  Cooper, Colin ^a   Frieze, Alan ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034344109     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200007)16:4<369::AID-RSA6>3.0.CO;2-J     Document Type: Article

References (18)

1. N. Alon, J. Spencer, and P. Erdos, The probabilistic method, John Wiley and Sons, New York, 1992.
2. B. Bollobás, Random graphs, Academic Press, New York, 1985.
3. C. Cooper and A. M. Frieze, The limiting probability that α-in, β-out is strongly is connected, J Combin Theory B 48 (1990), 117-134.
4. C. Cooper and A. M. Frieze, Hamilton cycles in a class of random directed graphs, J Combin Theory B 62 (1994), 151-163.
5. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
6. W. Feller, An introduction to probability theory and its applications, Vol. 1, John Wiley and Sons, New York, 1966.
7. T. I. Fenner and A. M. Frieze, On the connectivity of random m-orientable graphs and digraphs, Combinatorica 2 (1982), 347-359.
8. A. M. Frieze and T. Łuczak, "Hamiltonian cycles in a class of random graphs: one step further," Proceedings of Random Graphs '87, M. Karonski, J. Jaworski, and A. Rucmski (Editors), John Wiley and Sons, New York, 1990, pp. 53-59.
9. G. R. Grimmett and D. R. Stirzaker, Probability and random processes, Clarendon Press, Oxford, UK, 1983.
10. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Statist Assoc 58 (1963), 13-30.
11. S. Janson, D. E. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Structures and Algorithms 3 (1993) 233-358.
12. V. F. Kolchin, Random mappings, Optimization Software Inc., New York, 1986.
13. R. M. Karp, A. H. G. Rinnooy Kan, and R. V. Vohra, Average case analysis of a heuristic for the assignment problem, Math Oper Res 19 (1994), 513-522.
14. D. E. Knuth, R. Motwani, and B. Pittel, Stable marriage, Random Struct Alg 1 (1990), 1-14.
15. T. Luczak, B. Pittel, and J. Wierman, The structure of a random graph near the point of the phase transition, Transactions of the American Mathematical Society 341 (1994) 721-748.
16. B. Pittel, On tree census and the giant component in sparse random graphs, Random Struct Alg 1 (1990), 311-342.
17. B. Reed and C. J. H. McDiarmid, The strongly connected components of 1-in, 1-out, Combin Probab Comput 1 (1992), 265-274.
18. D. W. Walkup, Matchings in random regular bipartite digraphs, Discrete Math 31 (1980), 59-64.