## 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_{ℓ},K_{n})=2ℓ(n−1)+1for ℓ≥n≥3, where F_{ℓ} is the join K_{1}+ℓK_{2} of K_{1} and ℓK_{2}. In this paper, we prove that this conjecture is true for the case n=6.

Original language | English |
---|---|

Pages (from-to) | 1028-1037 |

Number of pages | 10 |

Journal | Discrete Mathematics |

Volume | 342 |

Issue number | 4 |

DOIs | |

Publication status | Published - 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_{ℓ},K

_{6})'. Together they form a unique fingerprint.