[vc_empty_space][vc_empty_space]
THE RAMSEY NUMBER for A LINEAR FOREST VERSUS TWO IDENTICAL COPIES of COMPLETE GRAPHS
Sudarsana I.W.a, Assiyatun H.b, Adiwijayac, Musdalifah S.a
a Combinatorial and Applied Mathematics Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Tadulako University (UNTAD), Palu, 94118, Indonesia
b Combinatorial Mathematics Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung (ITB), Bandung, 40132, Indonesia
c Computational Science Research Group, Faculty of Science, Institut Teknologi Telkom (IT TELKOM), Bandung, 40257, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2010 World Scientific Publishing Company.Let H be a graph with the chromatic number h and the chromatic surplus s. A connected graph G of order n is called H-good if R(G, H) = (n-1)(h-1) + s. In this paper, we show that Pn is 2Km-good for n ≥ 3. Furthermore, we obtain the Ramsey number R(L, 2Km), where L is a linear forest. Moreover, we also give the Ramsey number R(L, Hm) which is an extension for R(kPn, Hm) proposed by Ali et al. [1], where Hm is a cocktail party graph on 2m vertices.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text](G, H)-free,H-good,linear forest,path,Ramsey number[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text]The authors gratefully acknowledge to Professor Edy Tri Baskoro and Dr. Saladin Utunggadewa for helpful discussions while doing this research. The authors are also thankful to the anonymous referee for some comments that helped to improve the presentation of the manuscript. Research towards this paper was supported by sandwich-like program from the Directorate General of Higher Education of Indonesia (DIKTI) under Grant No. 529/D4.4/PK/2009.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1142/S1793830910000784[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]