Show simple item record

AuthorJaradat, A.M.M.
AuthorBaniabedalruhman, A.
AuthorBataineh, M.S.
AuthorJaradat, M.M.M.
Available date2023-11-09T05:37:22Z
Publication Date2021
Publication NameItalian Journal of Pure and Applied Mathematics
ResourceScopus
ISSN11268042
URIhttp://hdl.handle.net/10576/49116
AbstractFinding 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.
Languageen
PublisherForum-Editrice Universitaria Udinese SRL
SubjectComplete graph
Ramsey number
Theta graph
TitleThe theta-complete graph Ramsey number r(θk, K5); k = 7, 8, 9
TypeArticle
Pagination614-620
Issue Number46
dc.accessType Open Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record