F. Nisa, D. Rahmadani, Purwanto, H. Susanto
Let F, G and H be graphs. Notation F → (G, H) means that there is any two-coloring, say red and blue, of all edges of F which contains red subgraph isomorphic to G or blue subgraph isomorphic to H. The graph F is Ramsey (G, H)-minimal graph if F → (G, H) but F-e n (G, H) for any e ∈ E(F). The class of all Ramsey (G, H)-minimal graphs will be denoted by R(G, H). In this paper, we proved that there are only two graphs with six vertices that belong to Ramsey minimal graphs for certain pair of path and cycle (P 3, C 6) and we also determined some graphs with eight vertices in R(P 3, C 6). © Published under licence by IOP Publishing Ltd.
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Malang, Indonesia
