Zhao Wang

activity

20152022

most citedGallai-Ramsey numbers for fans

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

collaborators

17 papers

math.CO2022★ 2 cited

Euclidean Gallai-Ramsey Theory

Yaping Mao, Kenta Oeki, Zhao Wang

In this paper, we introduce Euclidean Gallai-Ramsey theory, by combining Euclidean Ramsey theory and Gallai-Ramsey theory on graphs. More precisely, we consider the following probl…

math.CO2022

Some multivariable Rado numbers

Gang Yang, Yaping Mao, Changxiang He +1

The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let $E$ be a linear equation. Denote by $R_{r} (E)$ the mi…

math.CO2021★ 1 cited

Gallai-Ramsey numbers involving a rainbow $4$ -path

Jinyu Zou, Zhao Wang, Hong-Jian Lai +1

Given two non-empty graphs $G, H$ and a positive integer $k$ , the Gallai-Ramsey number $gr_{k} (G : H)$ is defined as the minimum integer $N$ such that for all $n \geq N$ ,…

math.CO2020

Gallai-Ramsey number for the union of stars

Yaping Mao, Zhao Wang, Colton Magnant +1

Given a graph $G$ and a positive integer $k$ , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$ -edge coloring of the complete graph…

math.CO2020★ 1 cited

Gallai Ramsey number for double stars

Gyula O. H. Katona, Colton Magnant, Yaping Mao +1

Given a graph $G$ and a positive integer $k$ , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains…

math.CO2019

Fractional matching preclusion number of graphs

Jinyu Zou, Yaping Mao, Zhao Wang +1

The \emph{fractional matching preclusion number} of a graph $G$ , denoted by $f m p (G)$ , is the minimum number of edges whose deletion results in a graph that has no fractional perfec…