Yaser Rowshan

activity

20202024

B R (C_{8}, C_{2 n})

3 citations · 11 across the 18 of their papers we have counts for

collaborators

Showing 2022Show all

11 papers · 1 filter

math.CO2022

Partitioning of a graph into induced subgraphs not containing prescribed cliques

Yaser Rowshan, Ali Taherkhani

Let $K_{p}$ be a complete graph of order $p \geq 2$ . A $K_{p}$ -free $k$ -coloring of a graph $H$ is a partition of $V (H)$ into $V_{1}, V_{2} \dots, V_{k}$ such that $H [V_{i}]$ does not contain $K…

math.CO2022

Vertex Partitions and Maximum $\G$-free Subgraphs

Yaser Rowshan

We define a $(V_{1}, V_{2}, \dots, V_{k})$ -partition for a given graph $H$ and graphical properties $P_{1}, P_{2}, \dots, P_{k}$ as a partition where each $V_{i}$ induces a subgraph of $H$ wit…

math.CO2022

The $m$ -bipartite Ramsey number of the $K_{2, 2}$ versus $K_{6, 6}$

Yaser Rowshan

Given bipartite graphs $G_{1}, \dots, G_{n}$ , the bipartite Ramsey number $B R (G_{1}, \dots, G_{n})$ is the last integer $b$ such that any complete bipartite graph $K_{b, b}$ with edges col…

math.CO2022★ 1 cited

The $m$ -bipartite Ramsey number $B R_{m} (H_{1}, H_{2})$

Yaser Rowshan

In a $(G^{1}, G^{2})$ coloring of a graph $G$ , every edge of $G$ is in $G^{1}$ or $G^{2}$ . For two bipartite graphs $H_{1}$ and $H_{2}$ , the bipartite Ramsey number $B R (H_{1}, H_{2})$ is the least…

math.CO2022★ 1 cited

The $m$ -bipartite Ramsey number $B R_{m} (K_{2, 2}, K_{5, 5})$

Yaser Rowshan

The bipartite Ramsey number $B R (H_{1}, H_{2}, \dots, H_{k})$ , is the smallest positive integer $b$ , such that each $k$ -decomposition of $E (K_{b, b})$ contains $H_{i}$ in the $i$ -th class for…

math.CO2022★ 2 cited

Another view of Bipartite Ramsey numbers

Yaser Rowshan, Mostafa Gholami

For bipartite graphs $G$ and $H$ and a positive integer $m$ , the $m$ -bipartite Ramsey number $B R_{m} (G, H)$ of $G$ and $H$ is the smallest integer $n$ , such that every red-blue color…

math.CO2022

Extremal results on $G$ -free colorings of graphs

Yaser Rowshan

Let $H = (V (H), E (H))$ be a graph. A $k$ -coloring of $H$ is a mapping $π : V (H) ⟶ {1, 2, \dots, k}$ so that each color class induces a $K_{2}$ -free subgraph. For a graph $…

math.CO2022

On generalized list $\G$-free colorings of graphs

Yaser Rowshan

For given graph $H$ and graphical property $P$ , the conditional chromatic number $χ (H, P)$ of $H$ , is the smallest number $k$ , so that $V (H)$ can be decomposed into sets $V_1,V_2,\l…

math.CO2022★ 1 cited

Multipartite Ramsey number $m_{j} (K_{m}, n K_{2})$

Yaser Rowshan

Assume that $K_{j \times n}$ be a complete, multipartite graph consisting of $j$ partite sets and $n$ vertices in each partite set. For given graphs $G_{1}, G_{2}, \dots, G_{n}$ , the mult…

math.CO2022

Some bounds on the size of Maximum $G$ -free sets in graph

Yaser Rowshan

For given graph $H$ , the independence number $α (H)$ of $H$ , is the size of the maximum independent set of $V (H)$ . Finding the maximum independent set in a graph is a NP-hard proble…

math.CO2022

Nordhaus-Gaddum problem in term of $G$ -free coloring

Yaser Rowshan

Let $H = (V (H), E (H))$ be a graph. A $k$ -coloring of $H$ is a mapping $π : V (H) ⟶ {1, 2, \dots, k}$ , if each color class induces a $K_{2}$ -free subgraph. For a graph $G$ o…

Partitioning of a graph into induced subgraphs not containing prescribed cliques

Vertex Partitions and Maximum $\G$-free Subgraphs

The m-bipartite Ramsey number of the K2,2​ versus K6,6​

The m-bipartite Ramsey number BRm​(H1​,H2​)

The m-bipartite Ramsey number BRm​(K2,2​,K5,5​)

Another view of Bipartite Ramsey numbers

Extremal results on G-free colorings of graphs

On generalized list $\G$-free colorings of graphs

Multipartite Ramsey number mj​(Km​,nK2​)

Some bounds on the size of Maximum G-free sets in graph

Nordhaus-Gaddum problem in term of G-free coloring

The $m$ -bipartite Ramsey number of the $K_{2, 2}$ versus $K_{6, 6}$

The $m$ -bipartite Ramsey number $B R_{m} (H_{1}, H_{2})$

The $m$ -bipartite Ramsey number $B R_{m} (K_{2, 2}, K_{5, 5})$

Extremal results on $G$ -free colorings of graphs

Multipartite Ramsey number $m_{j} (K_{m}, n K_{2})$

Some bounds on the size of Maximum $G$ -free sets in graph

Nordhaus-Gaddum problem in term of $G$ -free coloring