Mostafa Gholami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mostafa Gholami has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Yaser Rowshan
Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 66731-45137, Iran
4 shared publications - Stanford Shateyi
Department of Mathematics and Applied Mathematics, School of Mathematical and Natural Sciences, University of Venda, P. Bag X5050, Thohoyandou 0950, South Africa
2 shared publications
Latest Publications
- Open Access
- 4 September 2023
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 7 (1) , #P1.05-12 pp.
Multipartite Ramsey number of complete graphs versus matchings
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.
- 4 September 2023
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 7 (1) , #P1.05-12 pp.
Open AccessMultipartite Ramsey number of complete graphs versus matchings
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.
- 30 December 2022
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (1) , 1-14
Multicolor bipartite Ramsey numbers for paths, cycles, and stripes
- 30 December 2022
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (1) , 1-14
Multicolor bipartite Ramsey numbers for paths, cycles, and stripes
- Open Access
- 23 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 701
A Proof of a Conjecture on Bipartite Ramsey Numbers B(2,2,3)
The bipartite Ramsey number is the least positive integer b, such that any coloring of the edges of with t colors will result in a monochromatic copy of in the i-th color, for some i, . The values , and have been computed in several previously published papers. In this paper, we obtain the exact values of the bipartite Ramsey number . In particular, we prove the conjecture on which was proposed in 2015—in fact, we prove that .- 23 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 701
Open AccessA Proof of a Conjecture on Bipartite Ramsey Numbers B(2,2,3)
The bipartite Ramsey number is the least positive integer b, such that any coloring of the edges of with t colors will result in a monochromatic copy of in the i-th color, for some i, . The values , and have been computed in several previously published papers. In this paper, we obtain the exact values of the bipartite Ramsey number . In particular, we prove the conjecture on which was proposed in 2015—in fact, we prove that . - Open Access
- 1 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (7) , 764
The Size, Multipartite Ramsey Numbers for nK2 Versus Path–Path and Cycle
For given graphs and any integer j, the size of the multipartite Ramsey number is the smallest positive integer t such that any n-coloring of the edges of contains a monochromatic copy of in color i for some i, , where 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 for any and , for any and .- 1 April 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (7) , 764
Open AccessThe Size, Multipartite Ramsey Numbers for nK2 Versus Path–Path and Cycle
For given graphs and any integer j, the size of the multipartite Ramsey number is the smallest positive integer t such that any n-coloring of the edges of contains a monochromatic copy of in color i for some i, , where 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 for any and , for any and .