On the Ramsey numbers for paths and generalized Jahangir graphs Js,m

Abstract

For given graphs G and H, the Ramsey number R(G, H) is the least natural number n such that for every graph F of order n the following condition holds: either F contains G or the complement of F contains H. In this paper, we determine the Ramsey number of paths versus generalized Jahangir graphs. We also derive the Ramsey number R(tPn, H), where H is a… (More)

Topics

Cite this paper

@inproceedings{Ali2008OnTR, title={On the Ramsey numbers for paths and generalized Jahangir graphs Js,m}, author={Kashif Ali and Edy Tri Baskoro and Ilinca Tomescu and Ioan Tomescu}, year={2008} }