On the Ramsey numbers for paths and generalized Jahangir graphs
| dc.creator | Ali, Kashif | |
| dc.creator | Baskoro, Edy Tri | |
| dc.creator | Tomescu, Ioan | |
| dc.date | 2008-05-10 | |
| dc.date.accessioned | 2026-07-07T09:38:13Z | |
| dc.date.available | 2026-07-07T09:38:13Z | |
| dc.description | 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$ 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(tP_n,H)$, where $H$ is a generalized Jahangir graph $J_{s,m}$ where $s\geq2$ is even, $m\geq3$ and $t\geq1$ is any integer. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/0805.1455 | |
| dc.identifier | http://arxiv.org/abs/0805.1455 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160730 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C55, 05D10 | |
| dc.title | On the Ramsey numbers for paths and generalized Jahangir graphs | |
| dc.type | text |