On the Ramsey numbers for paths and generalized Jahangir graphs

Kashif Ali, Edy Tri Baskoro, Ioan Tomescu

For given graphs $G$ and $H,$ the \emph{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$…