Show simple item record

AuthorJaradat, M. M.M.
AuthorBataineh, M. S.A.
AuthorAl Hazeem, N.
Available date2021-01-27T11:06:55Z
Publication Date2017
Publication NameArs Combinatoria
ResourceScopus
ISSN3817032
URIhttp://hdl.handle.net/10576/17499
AbstractFor any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph of at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. In fact, we prove that r(θn, K5) = 4n-3 for n = 6 and n ≥.
Languageen
PublisherCharles Babbage Research Centre
SubjectComplete graph
Independent set
Ramsey number
Theta graph
TitleThe theta-complete graph Ramsey number R(θn K5) = 4n - 3 for n = 6 and n≥ 10
TypeArticle
Pagination177-191
Volume Number134
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record