Farideh Khoeini

collaborators

3 papers

math.CO2017

On some three color Ramsey numbers for paths, cycles, stripes and stars

Farideh Khoeini, Tomasz Dzido

For given graphs $G_{1}, G_{2}, ..., G_{k}, k \geq 2$ , the multicolor Ramsey number $R (G_{1}, G_{2}, ..., G_{k})$ is the smallest integer $n$ such that if we arbitrarily color th…

math.CO2017

On the size-Ramsey number of cycles

Ramin Javadi, Farideh Khoeini, Gholam Reza Omidi +1

For given graphs $G_{1}, \dots, G_{k}$ , the size-Ramsey number $R^(G_{1}, \dots, G_{k})$ is the smallest integer $m$ for which there exists a graph $H$ on $m$ edges such that in every $…

math.CO2016

Size-Ramsey numbers of cycles versus a path

Andrzej Dudek, Farideh Khoeini, Paweł Prałat

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