The Ramsey number for a cycle of length six versus a clique of order eight

Yaojun Chen, Edwin Tai Chiu Cheng, Ran Xu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

3 Citations (Scopus)

Abstract

For two given graphs G1and G2, the Ramsey number R (G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1or the complement of G contains G2. Let Cmdenote a cycle of length m and Kna complete graph of order n. In this paper, it is shown that R (C6, K8) = 36.
Original languageEnglish
Pages (from-to)8-12
Number of pages5
JournalDiscrete Applied Mathematics
Volume157
Issue number1
DOIs
Publication statusPublished - 6 Jan 2009

Keywords

  • Complete graph
  • Cycle
  • Ramsey number

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this