Premium
On Path Convex Ramsey Numbers
Author(s) -
Jayawardene Chula J.,
Rousseau Cecil C.,
Harborth Heiko
Publication year - 2017
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22126
Subject(s) - combinatorics , mathematics , regular polygon , ramsey's theorem , path (computing) , convex combination , graph , convex optimization , computer science , geometry , programming language
In this article, we will first find the path convex Ramsey numbers for two‐colorings. Then using this, we will deduce some bounds for path convex Ramsey numbers for multicolorings. Next, we will find the convex Ramsey numbers for convex paths versus any graph containing a convex cycle, for convex paths versus stars, and for convex cycles versus stars.