27 Papers
51 Citations
Ye Wang is an academic researcher from Harbin Engineering University. The author has contributed to research in topics: Ramsey's theorem & Computer science. The author has an hindex of 2, co-authored 12 publications.
Chat about Author
Papers
Data-driven quantum approximate optimization algorithm for power systems
TL;DR: In this article , a data-driven Quantum Approximate Optimization Algorithm (QAOA) is proposed to transfer quasi-optimal parameters between weighted graphs based on the normalized graph density.
Minimal Ramsey graphs on deleting stars for generalized fans and books
Yan Li,Yusheng Li,Ye Wang +2 more
TL;DR: The star-critical Ramsey number R S is defined to be the largest p such that Kr∖K1,p → (G1, G2), where r = R ( G 1 , G 2 ) is the Ramsey number and r is the Stability Lemma and Regularity Lemma.
16
Star-critical Ramsey numbers involving graphs with long suspended paths
Ye Wang,Yusheng Li,Yan Li +2 more
TL;DR: It is shown that R S ( G, H n ) = n + O ( 1 ) for fixed G and H as n → ∞ , where H n is a graph of order n obtained from H by lengthening an edge to a path, each internal vertex of which has degree two.
11
Maximum star deleted from Ramsey graphs of book and tree
Ye Wang,Yusheng Li,Yan Li +2 more
TL;DR: This note considers an optimization problem to find the star-critical Ramsey number R S ( G, H ) defined as max { n | K r ∖ K 1 , n → ( G , H ) } by showing that for n ≥ 3 m, R S( B m, T n) = n − 2.
8
Ramsey numbers of several Kt, s and a large Km, n
Ye Wang,Yusheng Li,Yuan Li +2 more
TL;DR: For graphs G and H, the minimum n such that any edge-coloring of KN by k+1 colors contains either a monochromatic G in the first k colors or a monchromatic H in the last color is given in this article .
4