Size Multipartite Ramsey Numbers for Small Paths Versus Stripes

Jayawardene, Chula J.; Samarasekara, Lilanthi

doi:10.22457/apam.v12n2a12

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…studied by Greenwood and Gleason [6], studied by Exoo [5]. In [4], Jayawardene and Samarasekara studied size multiprtite Ramsey numbers for small paths versus stripes. The aim of this paper is determined with for .…”

Section: Introductionmentioning

confidence: 99%

The Set Multipartite Ramsey Numbers M_j(P_n, mK_2)

Sy,

Ma’ruf

2023

IJPSAT

View full text Add to dashboard Cite

For given two any graph H and G, the set multipartite Ramsey number M_j(G, H) is the smallest integer t such that for every factorization of graph K_(t×j):= F1 F2 so that F1 contains G as a subgraph or F2 contains H as a subgraph. In this paper, we determine M_j(P_n, mK_2) with j=3,4,5 and m>=2 where P_n denotes a path for n=2,3 vertices and mK_2 denotes a matching (stripes) of size m and pairwise disjoint edges.

show abstract

Section: Introductionmentioning

confidence: 99%