THE CYCLE-COMPLETE GRAPH RAMSEY NUMBER r(C5;K9)
The problem finding Ramsey number graphs is one of the problems developed from the classical Ramsey theory. Let F; G; and H be nonempty graphs. We write F → (G,H) means that any red-blue coloring of the edge of F, then F contains a red subgraph G or F contains a blue subgraph H. The Ramse...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/23511 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |