Hamilton cycles in random graphs and directed graphs

[1]  Jirí Matousek,et al.  Random lifts of graphs , 2001, SODA '01.

[2]  Martin E. Dyer,et al.  Approximately Counting Hamilton Paths and Cycles in Dense Graphs , 1998, SIAM J. Comput..

[3]  Alan M. Frieze,et al.  Hamilton Cycles in a Class of Random Directed Graphs , 1994, J. Comb. Theory, Ser. B.

[4]  Alexander H. G. Rinnooy Kan,et al.  Average Case Analysis of a Heuristic for the Assignment Problem , 1994, Math. Oper. Res..

[5]  Alan M. Frieze,et al.  Hamilton Cycles in Random Regular Digraphs , 1994, Combinatorics, Probability and Computing.

[6]  B. Pittel,et al.  The structure of a random graph at the point of the phase transition , 1994 .

[7]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[8]  Alan M. Frieze,et al.  When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? , 1992, IPCO.

[9]  Bruce A. Reed,et al.  The Strongly Connected Components of 1-in, 1-out , 1992, Combinatorics, Probability and Computing.

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Boris G. Pittel,et al.  On Tree Census and the Giant Component in Sparse Random Graphs , 1990, Random Struct. Algorithms.

[12]  Alan M. Frieze,et al.  The limiting probability that alpha-in, ß-out is strongly connected , 1990, J. Comb. Theory, Ser. B.

[13]  D. Knuth,et al.  Stable husbands , 1990, SODA '90.

[14]  Béla Bollobás,et al.  Random Graphs , 1985 .

[15]  A. Frieze,et al.  On the connectivity of randomm-orientable graphs and digraphs , 1982 .

[16]  W. Hoeffding.  Probability inequalities for sum of bounded random variables , 1963 .

[17]  W. Feller.  An Introduction to Probability Theory and Its Applications , 1959 .