Ye Wang

collaborators

2 papers

math.CO2026

Ramsey goodness of complete multipartite graphs with one large part

Shaonan Mi, Ye Wang

For graph $G$ , a connected graph $H$ of order $n$ is $G$ -good if $r (G, H) = (I ¨ (G) - 1) (n - 1) + s (G)$ , where $I ¨ (G)$ is the chromatic number of $G$ and $s (G)$ is the minimum size of a colo…

math.CO2024

Sharp Ramsey thresholds for large books

Qizhong Lin, Ye Wang

For graphs $G$ and $H$ , let $G \to H$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ . Let $G (N, p)$ be the random graph of order $N$ and edge probability…