CJChula J. Jayawardene

Chula J. Jayawardene

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chula J. Jayawardene has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The size, multipartite Ramsey numbers for C3 versus all graphs up to 4 vertices

    by Chula Jayawardene, Lilanthi Samarasekara

    Containing no loops or multiple edges. The multipartite graph K j×s (j j s is V (K j×s) = {v mn | m {1,2,...,j} and n {1,2,...,s} } and E (K j×s) = {v mn v kl | m,k {1,2,...,j} and n, l {1,2,...,s} where k m}. The set of vertices of the m th partite set is denoted by {v mn | n {1,2,...,s}}. If for every two-colouring (red and blue) of the edges of a graph K, there exists a copy of H colour (red) or a copy of G in the second colour (blue), we write K H,G). Given two simple graphs H and G, the Ramsey number r(H,G s such that K s H,G) and along the same line of reasoning, the multipartite Ramsey number m j (H,G positive integer s such that K j×s H,G). Thus, multipartite Ramsey number m j (C 3 ,G integer s such that any red-blue colouring of K j×s contains a red C 3 or a blue G. Since only a few multipartite Ramsey numbers all such multipartite Ramsey numbers m j (C 3 ,G) when G is any graph up to 4 vertices.


  • On Path Convex Ramsey Numbers

    by Chula J. Jayawardene, Cecil C. Rousseau, Heiko Harborth

    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.