On Ramsey (C4, K1, n)-minimal graphs
| Main Authors: | Assiyatun, Hilda; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia, Nabila, Maya; Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, \\ Institut Teknologi Bandung, Indonesia, Baskoro, Edy Tri; Center for Research Collaboration on Graph Theory and Combinatorics, Indonesia |
|---|---|
| Other Authors: | the Indonesian Ministry of Education, Culture, Research and Technology under the Research grant of ”Pendidikan Magister menuju Doktor untuk Sarjana Unggulan (PMDSU)" |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2023
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1811 https://www.ejgta.org/index.php/ejgta/article/view/1811/pdf_260 |
Daftar Isi:
- 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 R(G, H). In this paper, we construct a new class of Ramsey (C4, K1, n)-minimal graphs.