The theta-complete graph Ramsey number r(θk, K5); k = 7, 8, 9
| Author | Jaradat, A.M.M. |
| Author | Baniabedalruhman, A. |
| Author | Bataineh, M.S. |
| Author | Jaradat, M.M.M. |
| Available date | 2023-11-09T05:37:22Z |
| Publication Date | 2021 |
| Publication Name | Italian Journal of Pure and Applied Mathematics |
| Resource | Scopus |
| ISSN | 11268042 |
| Abstract | Finding the Ramsey number is an important problem of the well-known family of the combinatorial problems in Ramsey theory. In this work, we investigate the Ramsey number r(θs, K5) for s = 7, 8, 9 where θs is the set of theta graphs of order s and K5 is a complete graph of order 5. Our result closed the problem of finding R(θs, K5) for each s ≥ 6. |
| Language | en |
| Publisher | Forum-Editrice Universitaria Udinese SRL |
| Subject | Complete graph Ramsey number Theta graph |
| Type | Article |
| Pagination | 614-620 |
| Issue Number | 46 |
Files in this item
This item appears in the following Collection(s)
-
Materials Science & Technology [291 items ]