G. Omidi

activity

20112018

most citedRamsey numbers of 3-uniform loose paths and loose cycles

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

collaborators

Showing math.COShow all

13 papers · 1 filter

math.CO2017

On a question of Erdos and Faudree on the size Ramsey numbers

Ramin Javadi, Gholamreza Omidi

For given simple graphs $G_{1}$ and $G_{2}$ , the size Ramsey number $R^(G_{1}, G_{2})$ is the smallest positive integer $m$ , where there exists a graph $G$ with $m$ edges such that in…

math.CO2017

Minimum edge cuts of distance-regular and strongly regular digraphs

S. Ashkboos, G. R. Omidi, F. Shafiei +1

In this paper, we show that the edge connectivity of a distance-regular digraph $Γ$ with valency $k$ is $k$ and for $k > 2$ , any minimum edge cut of $Γ$ is the set of all edges going…

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

Ramsey numbers of uniform loose paths and cycles

Gholamreza Omidi, Maryam Shahsiah

Recently, determining the Ramsey numbers of loose paths and cycles in uniform hypergraphs has received considerable attention. It has been shown that the $2$ -color Ramsey number of…

math.CO2015

Diagonal Ramsey numbers of loose cycles in uniform hypergraphs

Gholamreza Omidi, Maryam Shahsiah

A $k$ -uniform loose cycle $C_{n}^{k}$ is a hypergraph with vertex set ${v_{1}, v_{2}, \dots, v_{n (k - 1)}}$ and with the set of $n$ edges $e_i=\{v_{(i-1)(k-1)+1},v_{(i-1)(k-1)+2},\…

math.CO2013

Ramsey numbers for multiple copies of hypergraphs

Gholam Reza Omidi, Ghaffar raeisi

In this paper, for sufficiently large $n$ we determine the Ramsey number $R (G, n H)$ where $G$ is a $k$ -uniform hypergraph with the maximum independent set that intersects each of th…