Melola Discovery

← Melola Discovery

Jurnal SINTA 1

On Ramsey (C4, K1, n)-minimal graphs

Electronic Journal of Graph Theory and Applications · Vol. 11 No. 1 (2023) · hlm. 149–154

DOI
10.5614/ejgta.2023.11.1.12
ISSN
2338-2287
Terbit
2023-04-08
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

Let F, G and H be any simple graphs. The notation F → (G, H) means 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. If F → (G, H), then graph F is called a Ramsey graph for (G, H). Additionally, if the graph F satisfies that F − e ↛ (G, H) for any edge e of F, then graph F is called a Ramsey (G, H)-minimal. The set of all Ramsey (G, H)-minimal graphs is denoted by ℛ(G, H). In this paper, we construct a new class of Ramsey (C4, K1, n)-minimal graphs.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 6 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Edy Tri; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung, Indonesia BaskoroAfiliasi tidak diketahui1
Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung NabilaAfiliasi tidak diketahui1

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 16 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">On Ramsey (C4, K1, n)-minimal graphs</dc:title>
	<dc:creator>Assiyatun, Hilda; Combinatorial Mathematics Research Group,
Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia</dc:creator>
	<dc:creator>Nabila, Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, \\ Institut Teknologi Bandung, Indonesia</dc:creator>
	<dc:creator>Baskoro, Edy Tri; Center for Research Collaboration on Graph Theory and Combinatorics, 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 any simple graphs. The notation F → (G, H) means 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. If F → (G, H), then graph F is called a Ramsey graph for (G, H). Additionally, if the graph F satisfies that F − e ↛ (G, H) for any edge e of F, then graph F is called a Ramsey (G, H)-minimal. The set of all Ramsey (G, H)-minimal graphs is denoted by ℛ(G, H). In this paper, we construct a new class of Ramsey (C4, K1, n)-minimal graphs. </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>2023-04-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/1811</dc:identifier>
	<dc:identifier>10.5614/ejgta.2023.11.1.12</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications; 149 - 154</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/1811/pdf_260</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>