Mengya He

collaborators

2 papers

math.CO2026

Ramsey multiplicity for ordered graphs

Mengya He, Yaping Mao, Bing Wei +1

Let $\cG_1,\ldots,\cG_k$ be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number $\oR(\cG_1,\ldots,\cG_k)$ is the least integer $N$ such…

math.CO2025

On the set-coloring Ramsey numbers of graphs

Mengya He, Yaping Mao

The \textit{set-coloring Ramsey number} $R_{r, s} (G_{1}, G_{2}, ..., G_{r})$ is the least $n \in N$ such that every coloring $Ï: E\left(K_n\right) \rightarrow\binom{[r]}{…