Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star
| Autor: | Maya Nabila, Hilda Assiyatun, Edy Tri Baskoro |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 289-299 (2022) |
| Druh dokumentu: | article |
| ISSN: | 2338-2287 |
| DOI: | 10.5614/ejgta.2022.10.1.20 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|