G. Omidi

activity

20112018

most citedGraphs whose normalized Laplacian has three eigenvalues

24 citations · 46 across the 18 of their papers we have counts for

collaborators

22 papers

cond-mat.stat-mech2018★ 10 cited

Universal Scaling Laws for Shear Induced Dilation in Frictional Granular Media

Mahesh M. Bandi, Prasenjit Das, Oleg Gendelman +2

Compressed frictional granular matter cannot flow without dilation. Upon forced shearing to generate flow, the amount of dilation may depend on the initial preparation and a host o…

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.CO2017

Stars versus stripes Ramsey numbers

G. R. Omidi, G. Raeisi, Z. Rahimi

For given simple graphs $G_{1}, G_{2}, \dots, G_{t}$ , the Ramsey number $R (G_{1}, G_{2}, \dots, G_{t})$ is the smallest positive integer $n$ such that if the edges of the complete graph $K_…

math.CO2016

Decompositions of complete uniform multi-hypergraphs into Berge paths and cycles of arbitrary lengths

Ramin Javadi, Afsaneh Khodadadpour, Gholamreza Omidi

In 1981, Alspach conjectured that the complete graph $K_{n}$ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This…