Author:
Nisa F,Rahmadani D,Purwanto ,Susanto H
Abstract
Abstract
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 ↛ (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).
Subject
General Physics and Astronomy
Reference12 articles.
1. A combinatorial problem in geometry;Erdos;Compositio Mathematic,1935
2. The size ramsey number;Erdos;Periodica Mathematica Hungarica,1978
3. On graphs of ramsey type;Burr;Ars Combinatoria,1976
4. On Ramsey (P3, P6)-minimal graphs;Rahmadani;AIP Conf. Proc.,2016