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

11 papers

math.CO2026

The multicolor induced size-Ramsey number of long subdivisions

Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei

For a positive integer $k$ and a graph $H$ , the $k$ -color induced size-Ramsey number $R^_{ind} (H, k)$ is the minimum integer $m$ for which there exists a graph $G$ wi…

math.CO2026

The Multicolor Size-Ramsey Number of Bipartite Long Subdivisions

Ramin Javadi, Yoshiharu Kohayakawa, Meysam Miralaei

For a positive integer $r$ , the $r$ -color size-Ramsey number~ $R_{r} (H)$ of a graph $H$ is the minimum number of edges in a graph $G$ such that every $r$ -edge coloring of $G…

math.CO2025

Graphs with asymmetric Ramsey properties

Walner Mendonça, Meysam Miralaei, Guilherme O. Mota

Given positive integers $k$ and $ℓ$ we write $G \to (K_{k}, K_{ℓ})$ if every 2-colouring of the edges of $G$ yields a red copy of $K_{k}$ or a blue copy of $K_{ℓ}$ and we d…

math.CO2024

A Conjecture on Rainbow Hamiltonian Cycle Decomposition

Ramin Javadi, Meysam Miralaei

Wu in 1999 conjectured that if $H$ is a subgraph of the complete graph $K_{2 n + 1}$ with $n$ edges, then there is a Hamiltonian cycle decomposition of $K_{2 n + 1}$ such that each edge…

math.CO2024

Bootstrap percolation on the Hamming graphs

Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie

The $r$ -edge bootstrap percolation on a graph is an activation process of the edges. The process starts with some initially activated edges and then, in each round, any inactive ed…

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…

math.CO2022

The weak saturation number of $K_{2, t}$

Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie

For two graphs $G$ and $F$ , we say that $G$ is weakly $F$ -saturated if $G$ contains no copy of $F$ as a subgraph and one could join all the nonadjacent pairs of vertices of $G$ in…

math.CO2021

Multicolor Size-Ramsey Number of Cycles

Ramin Javadi, Meysam Miralaei

Given a positive integer $r$ , the $r$ -color size-Ramsey number of a graph $H$ , denoted by $R^(H, r)$ , is the smallest integer $m$ for which there exists a graph $ G…

math.CO2019★ 5 cited

On the size-Ramsey number of grid graphs

Dennis Clemens, Meysam Miralaei, Damian Reding +2

The size-Ramsey number of a graph $F$ is the smallest number of edges in a graph $G$ with the Ramsey property for $F$ , that is, with the property that any 2-colouring of the edges…

math.CO2016

Size Ramsey numbers of stars versus cliques

Meysam Miralaei, Gholamreza Omidi, Maryam Shahsiah

The size Ramsey number $r^(G, H)$ of two graphs $G$ and $H$ is the smallest integer $m$ such that there exists a graph $F$ on $m$ edges with the property that every…