HAMILTONICITY OF QUASI-RANDOM GRAPHS

  • 투고 : 2002.01.10
  • 발행 : 2002.02.28

초록

It is well known that a random graph $G_{1/2}(n)$ is Hamiltonian almost surely. In this paper, we show that every quasirandom graph $G(n)$ with minimum degree $(1+o(1))n/2$ is also Hamiltonian.

키워드