On the Restricted Size Ramsey Number

Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)21-26
Number of pages6
JournalProcedia Computer Science
Publication statusPublished - 2015
Event2nd International Conference of Graph Theory and Information Security, 2015 - Bandung, Indonesia
Duration: 21 Sept 201523 Sept 2015


  • Restricted size Ramsey number
  • cycle
  • path


Dive into the research topics of 'On the Restricted Size Ramsey Number'. Together they form a unique fingerprint.

Cite this