Chula J. Jayawardene
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chula J. Jayawardene has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Cecil C. Rousseau
DEPARTMENT OF MATHEMATICAL SCIENCES THE UNIVERSITY OF MEMPHIS MEMPHIS TENNESSEE 38152
1 shared publication - Heiko Harborth
Diskrete Mathematik, Technische Universität Braunschweig, 38023 Braunschweig, Germany
1 shared publication Lilanthi Samarasekara
1 shared publication
Latest Publications
- Open Access
- 24 March 2017
- Published by Sri Lanka Journals Online in Journal of the National Science Foundation of Sri Lanka
- Vol. 45 (1) , 67
The size, multipartite Ramsey numbers for C3 versus all graphs up to 4 vertices
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.
- 24 March 2017
- Published by Sri Lanka Journals Online in Journal of the National Science Foundation of Sri Lanka
- Vol. 45 (1) , 67
Open AccessThe size, multipartite Ramsey numbers for C3 versus all graphs up to 4 vertices
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.
- 21 March 2017
- Published by Wiley in Journal of Graph Theory
- Vol. 86 (3) , 286-294
On Path Convex Ramsey Numbers
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.
- 21 March 2017
- Published by Wiley in Journal of Graph Theory
- Vol. 86 (3) , 286-294
On Path Convex Ramsey Numbers
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.