• 제목/요약/키워드: Paley graph

검색결과 1건 처리시간 0.014초

DIAMETERS AND CLIQUE NUMBERS OF QUASI-RANDOM GRAPHS

  • Lee, Tae Keug;Lee, Changwoo
    • Korean Journal of Mathematics
    • /
    • 제11권1호
    • /
    • pp.65-70
    • /
    • 2003
  • 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.

  • PDF