On the Ramsey numbers for a combination of paths and Jahangirs
| dc.creator | Ali, Kashif | |
| dc.creator | Baskoro, Edy Tri | |
| dc.date | 2007-11-16 | |
| dc.date.accessioned | 2026-07-07T08:43:22Z | |
| dc.date.available | 2026-07-07T08:43:22Z | |
| 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 improve the Surahmat and Tomescu's result \cite{ST:06} on the Ramsey number of paths versus Jahangirs. We also determine the Ramsey number $R(\cup G,H)$, where $G$ is a path and $H$ is a Jahangir graph. | |
| dc.identifier | https://arxiv.org/abs/0711.2571 | |
| dc.identifier | http://arxiv.org/abs/0711.2571 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/142288 | |
| dc.subject | Combinatorics | |
| dc.title | On the Ramsey numbers for a combination of paths and Jahangirs | |
| dc.type | text |