The ramsey number for theta graph versus a clique of order three and four

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 on 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. We determine...

Full description

Bibliographic Details

Published in:	Discussiones Mathematicae Graph Theory
Main Authors:	Bataineh M.S.A., Jaradat M.M.M., Bateeha M.S.
Format:	Article
Language:	English
Published:	University of Zielona Góra 2014-05-01
Subjects:	ramsey number independent set theta graph complete graph
Online Access:	https://doi.org/10.7151/dmgt.1730