#TITLE_ALTERNATIVE#
For certain graphs F, G and H, notation of F -> (G,H) mean that any red-blue coloring of the edges of F, There will be contains a red subgraph of G or a blue subgraph of H on F. Graph F is (G,H)-minimal Ramsey if F -> (G,H) and F* -> (G,H) for any real subgraph of F* of F. Then R(G,H) expla...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/14859 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | For certain graphs F, G and H, notation of F -> (G,H) mean that any red-blue coloring of the edges of F, There will be contains a red subgraph of G or a blue subgraph of H on F. Graph F is (G,H)-minimal Ramsey if F -> (G,H) and F* -> (G,H) for any real subgraph of F* of F. Then R(G,H) explains class consist of all (G,H)-minimal Ramsey graph. <br />
<br />
<br />
In 1978 Burr, Erdos and Faudree [2] have investigated class R(2K2,C3) by showing that R(2K2,C3) = {K5,2C3,B1}. In this final project, we investigate class of R(2K2,nC3) minimal Ramsey graph for n > 2. As result we got R(2K2,nC3) = {(n+1)C3, nK5, nB1, n1K5 U n2B1 U n3A1} for n1+n2+2n3=n {n1,n2,n3}>0 and n>1 and R(2K2,nC3) = tA1 for t=n/2, n>2 and n even. |
|---|