2 citations · 6 across the 12 of their papers we have counts for
5 papers · 2 filters
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…
Ramsey numbers of 3-uniform loose paths and loose cycles
Gholamreza Omidi, Maryam Shahsiah
Haxell et. al. [%P. Haxell, T. Luczak, Y. Peng, V. Rödl, A. %Ruciński, M. Simonovits, J. Skokan, The Ramsey number for hypergraph cycles I, J. Combin. Theory, Ser. A, 113 (2006), 6…
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…
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…
Large stars with few colors
Amir Khamseh, Gholam Reza Omidi
A recent question in generalized Ramsey theory is that for fixed positive integers , at least how many vertices can be covered by the vertices of no more than monochro…