Restricted Size Ramsey Number Involving Matching and Graph of Order Five
Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued the research and extended the result to all pairs of...
Main Authors: | Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa |
---|---|
Format: | Article |
Language: | English |
Published: |
ITB Journal Publisher
2020-09-01
|
Series: | Journal of Mathematical and Fundamental Sciences |
Subjects: | |
Online Access: | https://journals.itb.ac.id/index.php/jmfs/article/view/7058 |
Similar Items
-
Restricted size Ramsey number for path of order three versus graph of order five
by: Denny Riama Silaban, et al.
Published: (2017-04-01) -
On the restricted size Ramsey number for P3 versus dense connected graphs
by: Denny Riama Silaban, et al.
Published: (2020-10-01) -
On the Restricted Size Ramsey Number Involving a Path P3
by: Silaban Denny Riama, et al.
Published: (2019-08-01) -
The connected size Ramsey number for matchings versus small disconnected graphs
by: Hilda Assiyatun, et al.
Published: (2019-04-01) -
On Ramsey -minimal graphs
by: Kristiana Wijaya, et al.
Published: (2018-08-01)