Ya-Ping Mao

collaborators

4 papers

math.CO2026

Close Divisors of Typical Integers:The Ford--Green--Koukoulopoulos Conjecture

Yaping Mao, Yanyan Song

For an integer $k \geq 2$ , let $α_{k}$ be the supremum of the real numbers $a$ for which almost every integer $n \geq 2$ has divisors $d_{1} < \dots < d_{k} ∣ n$ satisfying $d_k\leq d_1\bigl(…

math.CO2025

On the size edge-ordered Ramsey numbers of graphs

Yanyan Song, Yaping Mao

For edge-ordered graphs $G^{≺}$ and $H^{≺}$ , the size edge-ordered Ramsey number $r^_{edge} (G^{≺}, H^{≺})$ is defined as the smallest integer $m$ for wh…

math.CO2025

Ramsey numbers for partially-ordered sets

Gyula O. H. Katona, Yaping Mao, Kenta Ozeki +1

We say that a poset $Q$ contains a copy (resp.~an induced copy) of a poset $P$ if there is an injection $f : P \to Q$ such that for any $x, y \in P$ , $f (x) \leq f (y)$ in $Q$ if (resp…

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]}{s…