1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2012
Around a conjecture of ErdH{o}s on graph Ramsey numbers
Leila Maherani, Gholamreza Omidi
For given graphs G1 and G2 the Ramsey number R(G1,G2), is the smallest positive integer n such that each blue-red edge coloring of the complete graph Kn contains a blue copy of G1…
math.CO2012★ 1 cited
The Ramsey number of loose paths in 3-uniform hypergraphs
Leila Maherani, Gholamreza Omidi, Ghaffar Raeisi +1
Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths wh…
math.CO2012
On three-color Ramsey number of paths
Leila Maherani, Gholamreza Omidi, Ghaffar Raeisi +1
Let be graphs. The multicolor Ramsey number is the smallest positive integer such that if the edges of complete graph are par…