W. Navaratna

most citedAll Ramsey

(C_{n}, K_{6})

critical graphs for large

n

2 citations · 3 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2019

On Star-critical (K1,n,K1,m + e) Ramsey numbers

C. J. Jayawardene, J. N. Senadheera, K. A. S. N. Fernando +1

Let $G, H$ be finite graphs without loops or multiple edges and $K_{n}$ denote the complete graph on $n$ vertices. If for every red/blue colouring of edges of the complete graph $K_n…

math.CO2019★ 1 cited

On Star critical Ramsey numbers related to large cycles versus complete graphs

C. J. Jayawardene, W. C. W. Navaratna

Let $K_{n}$ denote the complete graph on $n$ vertices and $G, H$ be finite graphs. Consider a two-coloring of edges of $K_{n}$ . When a copy of $G$ in the first color, red, or a copy of…

math.CO2019★ 2 cited

All Ramsey $(C_{n}, K_{6})$ critical graphs for large $n$

Chula J. Jayawardene, W. Chandanie W. Navaratna, J. N. Senadheera

Let $G$ and $H$ be finite graphs. If for any two-coloring of the edges of a complete graph $K_{n}$ , there is a copy of $G$ in the first color, red, or a copy of $H$ in the second col…

On Star-critical (K1,n,K1,m + e) Ramsey numbers

On Star critical Ramsey numbers related to large cycles versus complete graphs

All Ramsey (Cn​,K6​) critical graphs for large n

All Ramsey $(C_{n}, K_{6})$ critical graphs for large $n$