No Detail Found!

Gallai-Ramsey number for rainbow S3

Author(s)
Reji Thankachan Department of Mathematics, Government College Chittur,Palakkad, Kerala,India
Ruby Rosemary Department of Mathematics, Government College Chittur,Palakkad, Kerala,India
Sneha Balakrishnan Department of Mathematics, Government College Chittur,Palakkad, Kerala,India
Abstract
For the given graphs G and H, and for a positive integer k, the Gallai-Ramsey number is denoted by grk(G : H) and is defined as the minimum integer n such that every coloring of the complete graph Kn using at most k colors contains either a rainbow copy of G or a monochromatic copy of H. The k-color Ramsey number for G, denoted by Rk(G), is the minimum integer n such that every coloring of Kn using at most k colors contains a monochromatic copy of G in some color. Let Sn be the star graph on n edges and let Pn be the path graph on n vertices. Denote by Sn+ the graph obtained from Sn by adding an edge between any two pendant vertices. Let Tn+2 be the tree on n + 2 vertices obtained from Sn by subdividing one of its edges. In this paper, we consider grk(S3 : H), where H 2 fSn; Sn+; Pn; Tn+2g, and obtain its relation with R2(H) and R3(H). We also obtain 3-color Ramsey numbers for Sn, Sn+, and Tn+2.
Publication Details
Page(s) 45-50
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
monochromatic copy, Gallai-Ramsey number, coloring, rainbow copy
0

Citations

0

Downloads

25

Views