Jurnal
SINTA 1
Size multipartite Ramsey numbers for stripes versus small cycles
Jayawardene, Chula Janak; Department of Mathematics, University of Colombo, Colombo, Sri Lanka
Baskoro, Edy Tri; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia
Samarasekara, Lilanthi; Department of Mathematics, University of Colombo, Colombo, Sri Lanka
Sy, Syafrizal; Universitas Andalas, Padang, Indonesia
Electronic Journal of Graph Theory and Applications · Vol. 4 No. 2 (2016) · hlm. 157–170
ISSN 2338-2287
Terbit 2016-10-08
Penerbit GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa eng
Abstrak
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as the smallest natural number $s$ such that any arbitrary two coloring of the graph $K_{j \times s}$ using the colors red and blue, contains a red $G_1$ or a blue $G_2$ as subgraphs. In this paper, we obtain the exact values of the size Ramsey numbers $m_j(nK_2, C_m)$ for $j \ge 2$ and $m \in \{3,4,5,6\}$.
Jaringan kolaborasi para penulis
11 penulis ·
16 tautan kepenulisan bersama
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulis Organisasi Artikel bersama
Rinovia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia Simanjuntak Afiliasi tidak diketahui 1
S.; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia Susilawati Afiliasi tidak diketahui 1
Hilda; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia Assiyatun Afiliasi tidak diketahui 1
Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung Nabila Afiliasi tidak diketahui 1
Nobuaki; Graduate School of Information Sciences, Tohoku University, Sendai 980-8579 Japan. Obata Afiliasi tidak diketahui 1
Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India Pirzada Afiliasi tidak diketahui 1
Mushtaq; Department of Mathematics, AAAM Degree College, Bemina, Srinagar, India Shah Afiliasi tidak diketahui 1
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">Size multipartite Ramsey numbers for stripes versus small cycles</dc:title>
<dc:creator>Jayawardene, Chula Janak; Department of Mathematics, University of Colombo, Colombo, Sri Lanka</dc:creator>
<dc:creator>Baskoro, Edy Tri; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia</dc:creator>
<dc:creator>Samarasekara, Lilanthi; Department of Mathematics,
University of Colombo, Colombo, Sri Lanka</dc:creator>
<dc:creator>Sy, Syafrizal; Universitas Andalas, Padang, Indonesia</dc:creator>
<dc:subject xml:lang="en-US">graph theory, Ramsey theory</dc:subject>
<dc:description xml:lang="en-US">For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as the smallest natural number $s$ such that any arbitrary two coloring of the graph $K_{j \times s}$ using the colors red and blue, contains a red $G_1$ or a blue $G_2$ as subgraphs. In this paper, we obtain the exact values of the size Ramsey numbers $m_j(nK_2, C_m)$ for $j \ge 2$ and $m \in \{3,4,5,6\}$.</dc:description>
<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
<dc:contributor xml:lang="en-US"></dc:contributor>
<dc:date>2016-10-08</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/179</dc:identifier>
<dc:identifier>10.5614/ejgta.2016.4.2.4</dc:identifier>
<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications; 157-170</dc:source>
<dc:source>2338-2287</dc:source>
<dc:language>eng</dc:language>
<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/179/pdf_23</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2016 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Jayawardene, C. J. D. o. M. U. o. C. C. S. L., Baskoro, E. T. C. M. R. G. F. o. M. a. N. S. I. T. B. I., Samarasekara, L. D. o. M. U. o. C. C. S. L., & Sy, S. U. A. P. I. (2016). Size multipartite Ramsey numbers for stripes versus small cycles. Electronic Journal of Graph Theory and Applications, 4(2), 157–170. https://doi.org/10.5614/ejgta.2016.4.2.4
Salin
IEEE
C. J. D. o. M. U. o. C. C. S. L. Jayawardene, E. T. C. M. R. G. F. o. M. a. N. S. I. T. B. I. Baskoro, L. D. o. M. U. o. C. C. S. L. Samarasekara, and S. U. A. P. I. Sy, “Size multipartite Ramsey numbers for stripes versus small cycles,” Electronic Journal of Graph Theory and Applications, vol. 4, no. 2, pp. 157–170, 2016, doi: 10.5614/ejgta.2016.4.2.4.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.