Yanbo Zhang

most citedProof of a Conjecture on Online Ramsey Numbers of Paths

2 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2024

Size Ramsey numbers of small graphs versus fans or paths

Yufan Li, Yanbo Zhang, Yunqing Zhang

For two graphs $G_{1}$ and $G_{2}$ , the size Ramsey number $r^(G_{1}, G_{2})$ is the smallest positive integer $m$ for which there exists a graph $G$ of size $m$ such that for any red-…

math.CO2023

Ramsey goodness of fans

Yanbo Zhang, Yaojun Chen

Given two graphs $G_{1}$ and $G_{2}$ , the Ramsey number $r (G_{1}, G_{2})$ refers to the smallest positive integer $N$ such that any graph $G$ with $N$ vertices contains $G_{1}$ as a subgraph,…

math.CO2023★ 2 cited

Proof of a Conjecture on Online Ramsey Numbers of Paths

Yanbo Zhang, Yixin Zhang

For two graphs $G_{1}$ and $G_{2}$ , the online Ramsey number $r ~ (G_{1}, G_{2})$ is the smallest number of edges that Builder draws on an infinite empty graph to guarantee that there…

math.CO2023

Proof of a Conjecture on Online Ramsey Numbers of Stars versus Paths

Ruyu Song, Sha Wang, Yanbo Zhang

Given two graphs $G$ and $H$ , the online Ramsey number $r ~ (G, H)$ is defined to be the minimum number of rounds that Builder can always guarantee a win in the following $(G,…