Korean Journal of Mathematics

The Kangwon-Kyungki Mathematical Society (강원경기수학회)
권호 표지

DIAMETERS AND CLIQUE NUMBERS OF QUASI-RANDOM GRAPHS

  • Received : 2003.02.07
  • Published : 2003.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

We show that every quasi-random graph $G(n)$ with $n$ vertices and minimum degree $(1+o(1))n/2$ has diameter either 2 or 3 and that every quasi-random graph $G(n)$ with n vertices has a clique number of $o(n)$ with wide spread.

Keywords