The graph Ramsey number R(F,K6)

Shin ya Kadota, Tomokazu Onozuka, Yuta Suzuki

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

For a given pair of two graphs (F,H), let R(F,H) be the smallest positive integer r such that for any graph G of order r, either G contains F as a subgraph or the complement of G contains H as a subgraph. Baskoro, Broersma and Surahmat (2005) conjectured that R(F,Kn)=2ℓ(n−1)+1for ℓ≥n≥3, where F is the join K1+ℓK2 of K1 and ℓK2. In this paper, we prove that this conjecture is true for the case n=6.

Original languageEnglish
Pages (from-to)1028-1037
Number of pages10
JournalDiscrete Mathematics
Volume342
Issue number4
DOIs
Publication statusPublished - Apr 2019

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'The graph Ramsey number R(F<sub>ℓ</sub>,K<sub>6</sub>)'. Together they form a unique fingerprint.

Cite this