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:
| 主要作者: | |
|---|---|
| 格式: | Theses |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/23511 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|