[vc_empty_space][vc_empty_space]
On Size Multipartite Ramsey Numbers for Stars versus Cycles
Lusiani A.a, Sy S.b, Baskoro E.T.a, Jayawardene C.c
a Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Bandung, 40132, Indonesia
b Departement of Mathematics, Andalas University, Kampus Unand Limau Manis Padang, 25163, Indonesia
c Departement of Mathematics, University of Colombo, Colombo, Sri Lanka
[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]© 2015 The Authors.For given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey numbers mj(G1, G2) is the smallest integer t such that every factorization of the graph KjXt:= F1 ⊕ F2 satisfies the following condition: either F1 contains G1 or F2 contains G2. In this paper, we determine mj(Sm, Cn) for j, m, n ≥ 3 where S m is a star on m vertices and Cn is a cycle on n 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]Cycle,Ramsey numbers,Two-graphs[/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]Cycle,size multipartite Ramsey number,star[/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]Acknowledgement. This research was supported by Research Grant ”Program Riset dan Inovasi KK-ITB”, Ministry of Research, Technology and Higher Education, Indonesia.[/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.1016/j.procs.2015.12.070[/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]