TY - JOUR
T1 - On the Restricted Size Ramsey Number
AU - Silaban, Denny Riama
AU - Baskoro, Edy Tri
AU - Uttunggadewa, Saladin
N1 - Funding Information:
Acknowledgement. This research was supported by Research Grant ”Program Riset dan Inovasi KK-ITB” 2015, Ministry of Research, Technology, and Higher Education, Indonesia.
PY - 2015
Y1 - 2015
N2 - Let F, G, and H be simple graphs. We say F → (G, H) if for every 2-coloring of the edges of F there exists a monochromatic G or H in F. The Ramsey number r(G, H) is defined as min {|V (F)|: F → (G, H)}, while the restricted size Ramsey number r∗(G, H) is defined as min {|E (F)|: F → (G, H), |V (F) | = r(G, H)}. In this paper, we give lower and upper bounds for the restricted size Ramsey number for a path P3 versus cycles Cn.
AB - Let F, G, and H be simple graphs. We say F → (G, H) if for every 2-coloring of the edges of F there exists a monochromatic G or H in F. The Ramsey number r(G, H) is defined as min {|V (F)|: F → (G, H)}, while the restricted size Ramsey number r∗(G, H) is defined as min {|E (F)|: F → (G, H), |V (F) | = r(G, H)}. In this paper, we give lower and upper bounds for the restricted size Ramsey number for a path P3 versus cycles Cn.
KW - Restricted size Ramsey number
KW - cycle
KW - path
UR - http://www.scopus.com/inward/record.url?scp=84964047289&partnerID=8YFLogxK
U2 - 10.1016/j.procs.2015.12.069
DO - 10.1016/j.procs.2015.12.069
M3 - Conference article
AN - SCOPUS:84964047289
SN - 1877-0509
VL - 74
SP - 21
EP - 26
JO - Procedia Computer Science
JF - Procedia Computer Science
T2 - 2nd International Conference of Graph Theory and Information Security, 2015
Y2 - 21 September 2015 through 23 September 2015
ER -