M. Miralaei

activity

20162026

most citedOn the size-Ramsey number of grid graphs

5 citations · 5 across the 10 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Weak saturation numbers in random graphs

Olga Kalinichenko, Meysam Miralaei, Ali Mohammadian +1

For two given graphs $G$ and $F$ , a graph $H$ is said to be weakly $(G, F)$ -saturated if $H$ is a spanning subgraph of $G$ which has no copy of $F$ as a subgraph and one can ad…

math.CO2023

Saturation numbers of bipartite graphs in random graphs

Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie +1

For a given graph $F$ , the $F$ -saturation number of a graph $G$ , denoted by $s a t (G, F)$ , is the minimum number of edges in an edge-maximal $F$ -free subgraph of $G$ . In 2017, Kor…