Mostafa Gholami

Dr. Mostafa Gholami

Author of the paper

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
YRyaser rowshan
yaser rowshan
MGMostafa Gholami
Mostafa Gholami
SSStanford Shateyi
Stanford Shateyi
For given graphs G1,G2,…,Gn and any integer j, the size of the multipartite Ramsey number mj(G1,G2,…,Gn) is the smallest positive integer t such that any n-coloring of the edges of Kj×t contains a monochromatic copy of Gi in color i for some i, 1≤i≤n, where Kj×t denotes the complete multipartite graph having j classes with t vertices per each class. In this paper, we computed the size of the multipartite Ramsey numbers mj(K1,2,P4,nK2) for any j,n≥2 and mj(nK2,C7), for any j≤4 and n≥2.

30 December 2022 in Computational and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
YRyaser rowshan
yaser rowshan
MGMostafa Gholami
Mostafa Gholami

23 February 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
YRyaser rowshan
yaser rowshan
MGMostafa Gholami
Mostafa Gholami
SSStanford Shateyi
Stanford Shateyi
The bipartite Ramsey number B(n1,n2,…,nt) is the least positive integer b, such that any coloring of the edges of Kb,b with t colors will result in a monochromatic copy of Kni,ni in the i-th color, for some i, 1≤i≤t. The values B(2,5)=17, B(2,2,2,2)=19 and B(2,2,2)=11 have been computed in several previously published papers. In this paper, we obtain the exact values of the bipartite Ramsey number B(2,2,3). In particular, we prove the conjecture on B(2,2,3) which was proposed in 2015—in fact, we prove that B(2,2,3)=17.

4 September 2023 in The Art of Discrete and Applied Mathematics
Verified
Journal Article
Open access
PDF file
YRyaser rowshan
yaser rowshan
MGMostafa Gholami
Mostafa Gholami
Assume that Kj × n is a complete and multipartite graph consisting of j partite sets and n vertices in each partite set. For the given graphs G1, G2, …, Gn, the multipartite Ramsey number (M-R-number) mj(G1,G2,…,Gn), is the smallest integer t, such that for any n-edge-coloring (G1,G2,…,Gn) of the edges of Kj × t, Gi contains a monochromatic copy of Gi for at least one i. The size of M-R-number mj(nK2,Cm) for j, n ≥ 2 and 4 ≤ m ≤ 6, the size of M-R-number mj(nK2,C7) for j ≥ 2 and n ≥ 2, the size of M-R-number mj(nK2,K3) for each j, n ≥ 2, the size of M-R-number mj(K3,K3,n1K2,n2K2,…,niK2) for j ≤ 6 and i, ni ≥ 1, and the size of M-R-number mj(K3,K3,nK2) for j ≥ 2 and n ≥ 1 have been computed in several previously published papers. In this article, we obtain the values of M-R-number mj(Km,nK2) for j, n ≥ 2 and m ≥ 4.