Size multipartite Ramsey numbers for small paths versus books
Indonesian Journal of Combinatorics · 2016
DOI: 10.19184/ijc.2016.1.1.4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2016. Verfasst von Chula J. Jayawardene und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Given $j \ge 2$, for graphs $G$ and $H$, the size Ramsey multipartite number $m_j(G, H)$ is defined as the smallest natural number $t$ such that any blue red coloring of the edges of the graph $K_{j \times t}$, necessarily containes a red $G$ or a blue $H$ as subgraphs. Let the book with $n$ pages is defined as the graph $K_1 + K_{1,n}$ and denoted by $B_n$. In this paper, we obtain the exact values of the size Ramsey numbers $m_j(P_3, H)$ for $j \ge 3$ where $H$ is a book $B_n$. We also derive some upper and lower bounds for the size Ramsey numbers $m_j(P_4, H)$ where $H$ is a book $B_n$.
Zitieren
APA
Jayawardene, C. J., & Ratnayake, J. (2016). Size multipartite Ramsey numbers for small paths versus books. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2016.1.1.4
Vancouver
Jayawardene CJ, Ratnayake J. Size multipartite Ramsey numbers for small paths versus books. Indonesian Journal of Combinatorics. 2016. doi:10.19184/ijc.2016.1.1.4
BibTeX
@article{Jayawardene2016,
author = {Jayawardene, Chula J. and Ratnayake, Jayampathy},
title = {Size multipartite Ramsey numbers for small paths versus books},
journal = {Indonesian Journal of Combinatorics},
year = {2016},
doi = {10.19184/ijc.2016.1.1.4}
}
EUVIMED