Ye Wang

activity

20172026

most citedRedundant edges in Ramsey graphs

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

collaborators

6 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) = (χ (G) - 1) (n - 1) + s (G)$ , where $χ (G)$ is the chromatic number of $G$ and $s (G)$ is the minimum size of a color…

math.CO2023

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…

quant-ph2022

Data-Driven Quantum Approximate Optimization Algorithm for Cyber-Physical Power Systems

Hang Jing, Ye Wang, Yan Li

Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems, especially for Distributed Energy Resources (DERs) dominant c…

math.CO2021

Ramsey numbers of graphs with most degrees bounded in random graphs

Ye Wang, Yusheng Li

For graphs $F$ and $G$ , let $F \to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$ . Denote by $G (N, p)$ the random graph space of order $N$ and…

math.CO2019

Degree bipartite Ramsey numbers

Ye Wang, Yusheng Li, Yan Li

Let $H s G$ denote that any edge-coloring of $H$ by $s$ colors contains a monochromatic $G$ . The degree Ramsey number $r_{Δ} (G; s)$ is defined to be $\min\{Δ(H):H\xrighta…

math.CO2017★ 1 cited

Redundant edges in Ramsey graphs

Ye Wang, Yusheng Li, Yan Li

For graphs $G$ , $F$ and $H$ , let $G \to (F, H)$ signify that any edge coloring of $G$ in red and blue contains a red $F$ or a blue $H$ . The Ramsey number $R(F,H)=\min\{r|\; K…