yaser rowshan

Dr. yaser rowshan

Author - Pharmacy Student - UNIVAR
+1

Research Focus & Metrics

Academic Career Length

7Years (2020-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

4 April 2022 in Discrete Mathematics
Verified
Journal Article
Closed access
YRyaser rowshan
yaser rowshan
ATAli Taherkhani
Ali Taherkhani

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.

1 January 2024 in Discussiones Mathematicae Graph Theory
Verified
Journal Article
Closed access
YRyaser rowshan
yaser rowshan

26 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
JDJanusz Dybizbański
Janusz Dybizbański
YRyaser rowshan
yaser rowshan
The $p$-partite Ramsey number for quadrilateral, denoted by $r_p(C_4,k)$, is the least positive integer $n$ such that any coloring of the edges of a complete $p$-partite graph with $n$ vertices in each partition with $k$ colors will result in a monochromatic copy of $C_4$. In this paper, we present an upper bound for $r_p(C_4,k)$ and the exact values of $r_p(C_4,2)$ for all $p\geq2$. In tripartite case we show that $r_3(C_4,k) \leq \lfloor (k+1)^2/2\rfloor-1$ and the exact value of 4-color tripartite Ramsey number $r_3(C_4,4)=11$.