The theta-complete graph Ramsey number R(θn K5) = 4n - 3 for n = 6 and n≥ 10
Author | Jaradat, M. M.M. |
Author | Bataineh, M. S.A. |
Author | Al Hazeem, N. |
Available date | 2021-01-27T11:06:55Z |
Publication Date | 2017 |
Publication Name | Ars Combinatoria |
Resource | Scopus |
ISSN | 3817032 |
Abstract | For 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 ≥. |
Language | en |
Publisher | Charles Babbage Research Centre |
Subject | Complete graph Independent set Ramsey number Theta graph |
Type | Article |
Pagination | 177-191 |
Volume Number | 134 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Mathematics, Statistics & Physics [726 items ]