THE RAMSEY NUMBER FOR TREE WITH HIGH MAXIMUM DEGREE VERSUS WHEEL OF ORDER NINE
<p align="justify">For two given graphs G andH, the Ramsey number R(G;H) is the smallest positive integer n such that every graph F of order n, F contains G or F contains H. <br /> <br /> The Ramsey number of stars versus wheels as well as trees versus wheels have been de...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/31859 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | <p align="justify">For two given graphs G andH, the Ramsey number R(G;H) is the smallest positive integer n such that every graph F of order n, F contains G or F contains H. <br />
<br />
The Ramsey number of stars versus wheels as well as trees versus wheels have been determined in some previous papers. <br />
<br />
<br />
...... <br />
<br />
<p align="justify"> |
|---|