Abstrak
Let F, G and H be simple graphs. The notation F → (G, H) means that for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. A graph F is called a Ramsey (G, H)-minimal graph if it satisfies two conditions: (i) F → (G, H) and (ii) F − e ↛ (G, H) for any edge e of F. In this paper, we give some finite and infinite classes of Ramsey (C4, K1, n)-minimal graphs for any n ≥ 3.
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">Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star</dc:title>
<dc:creator>Nabila, Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung</dc:creator>
<dc:creator>Assiyatun, Hilda; Combinatorial Mathematics Research Group,
Faculty of Mathematics and Natural Sciences,
Institut Teknologi Bandung, Indonesia</dc:creator>
<dc:creator>Baskoro, Edy Tri; Combinatorial Mathematics Research Group,
Faculty of Mathematics and Natural Sciences,
Institut Teknologi Bandung, Indonesia</dc:creator>
<dc:subject xml:lang="en-US">Ramsey minimal graph, cycle, star</dc:subject>
<dc:subject xml:lang="en-US">05C55, 05D10</dc:subject>
<dc:description xml:lang="en-US">Let F, G and H be simple graphs. The notation F → (G, H) means that for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. A graph F is called a Ramsey (G, H)-minimal graph if it satisfies two conditions: (i) F → (G, H) and (ii) F − e ↛ (G, H) for any edge e of F. In this paper, we give some finite and infinite classes of Ramsey (C4, K1, n)-minimal graphs for any n ≥ 3.</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">The Indonesian Ministry of Education, Culture, Research and Technology under the Research grant of ”Pendidikan Magister menuju Doktor untuk Sarjana Unggulan (PMDSU)".</dc:contributor>
<dc:date>2022-04-28</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/1526</dc:identifier>
<dc:identifier>10.5614/ejgta.2022.10.1.20</dc:identifier>
<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 10, No 1 (2022): Electronic Journal of Graph Theory and Applications; 289-299</dc:source>
<dc:source>2338-2287</dc:source>
<dc:language>eng</dc:language>
<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/1526/pdf_220</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2022 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>