G. Raeisi

activity

20112026

most citedThe Ramsey number of loose paths in 3-uniform hypergraphs

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

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2026

Matchings in hypergraphs via Ore-degree conditions

József Balogh, Cory Palmer, Ghaffar Raeisi

Let $H \subseteq (r [ n ])$ be an $r$ -uniform hypergraph on vertex set $[n] = {1, 2, \dots, n}$ . For an $r$ -set of vertices $S \subseteq [n]$ , the \emph{degree} of $…

math.CO2021

On a Conjecture of Erd\H os on Size Ramsey Number of Star Forests

Akbar Davoodi, Ramin Javadi, Azam Kamranian +1

Given graphs $F_{1}, F_{2}$ and $G$ , we say that $G$ is Ramsey for $(F_{1}, F_{2})$ and we write $G \to (F_{1}, F_{2})$ , if for every edge coloring of $G$ by red and blue, there is eithe…

math.CO2019

On the star-critical Ramsey number of a forest versus complete graphs

Azam Kamranian, Ghaffar Raeisi

Let $G$ and $G_{1}, G_{2}, \dots, G_{t}$ be given graphs. By $G \to (G_{1}, G_{2}, \dots, G_{t})$ we mean if the edges of $G$ are arbitrarily colored by $t$ colors, then for some $i…

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…

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 $G_{1}, G_{2}, ..., G_{t}$ be graphs. The multicolor Ramsey number $R (G_{1}, G_{2}, ..., G_{t})$ is the smallest positive integer $n$ such that if the edges of complete graph $K_{n}$ are par…