#TITLE_ALTERNATIVE#
Let F, G dan H be graphs. The notation F ! (G;H) means that any red-blue <br /> <br /> <br /> <br /> <br /> coloring of the edges of F contains a red subgraph G or a blue subgraph H. Graph <br /> <br /> <br /> <br /> <br /...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/18563 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Let F, G dan H be graphs. The notation F ! (G;H) means that any red-blue <br />
<br />
<br />
<br />
<br />
coloring of the edges of F contains a red subgraph G or a blue subgraph H. Graph <br />
<br />
<br />
<br />
<br />
F is called a Ramsey (G;H)minimal graph if it satisfies that F ! (G;H) and <br />
<br />
<br />
<br />
<br />
F fie9(G;H) for any e 2 E(F). The notation Â(G;H) is the class of all Ramsey <br />
<br />
<br />
<br />
<br />
(G;H)minimal graph. In this Final Project we derive some necessary conditions <br />
<br />
<br />
<br />
<br />
of graphs belong to Â(P3;P5). From these conditions, we determine some graphs <br />
<br />
<br />
<br />
<br />
containing a cycle which belong to Â(P3;P5). |
|---|