English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For given graphs $G$ and $H,$ the \emph{Ramsey number} $R(G,H)$ is the leastnatural number $n$ such that for every graph $F$ of order $n$ the followingcondition holds: either $F$ contains $G$ or the complement of $F$ contains $H.$In this paper, we determine the Ramsey number of paths versus generalizedJahangir graphs. We also derive the Ramsey number $R(tP_n,H)$, where $H$ is ageneralized Jahangir graph $J_{s,m}$ where $s\geq2$ is even, $m\geq3$ and$t\geq1$ is any integer.

On the Ramsey numbers for paths and generalized Jahangir graphs