대한수학회논문집 (Communications of the Korean Mathematical Society)

  • 제14권2호
  • /
  • Pages.295-299
  • /
  • 1999
  • /
  • 1225-1763(pISSN)
  • /
  • 2234-3024(eISSN)
대한수학회 (Korean Mathematical Society)
권호 표지

A NOTE ON CONNECTEDNESS OF QUASI-RANDOM GRAPHS

  • 발행 : 1999.04.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Every quasi-random graph G(n) on n vertices consists of a giant component plus o(n) vertices, and every quasi-random graph G(n) with minimum degree (1+o(1))\ulcorner is connected.

키워드

참고문헌

  1. Random Graphs B. Bollobas
  2. J. Amer. Math. Soc. v.4 Quasi-random Set Systems F. R. K. Chung;R. L. Graham
  3. Random Graphs v.2 Maximum Cuts and Quasi-random Graphs A. Frieze;T. Luczak(eds.)
  4. Quasi-random Graphs, Combinatorica v.9 F. R. K. Chung;R. L. Graham;R. M. Wilson
  5. Proc. London Math. Soc. v.2 A Note on Hamiltonian Circuits V. Chvatal;P. Erdos
  6. Graphical Evolution E. M. Palmer