### Abstract

Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.

Original language | English |
---|---|

Pages (from-to) | 173-178 |

Number of pages | 6 |

Journal | North-Holland Mathematics Studies |

Volume | 115 |

Issue number | C |

DOIs | |

Publication status | Published - 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*North-Holland Mathematics Studies*,

*115*(C), 173-178. https://doi.org/10.1016/S0304-0208(08)73007-X

**First Occurrence of Hamilton Cycles in Random Graphs.** / Ajtai, M.; Komlós, J.; Szemerédi, E.

Research output: Contribution to journal › Article

*North-Holland Mathematics Studies*, vol. 115, no. C, pp. 173-178. https://doi.org/10.1016/S0304-0208(08)73007-X

}

TY - JOUR

T1 - First Occurrence of Hamilton Cycles in Random Graphs

AU - Ajtai, M.

AU - Komlós, J.

AU - Szemerédi, E.

PY - 1985

Y1 - 1985

N2 - Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.

AB - Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.

UR - http://www.scopus.com/inward/record.url?scp=0242368930&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242368930&partnerID=8YFLogxK

U2 - 10.1016/S0304-0208(08)73007-X

DO - 10.1016/S0304-0208(08)73007-X

M3 - Article

AN - SCOPUS:0242368930

VL - 115

SP - 173

EP - 178

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

SN - 0304-0208

IS - C

ER -