Jinyu Zou

activity

20182021

most citedGallai-Ramsey numbers of odd cycles

7 citations · 13 across the 6 of their papers we have counts for

collaborators

6 papers

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.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…

math.CO2018★ 5 cited

Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs

Zhao Wang, Yaping Mao, 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 $K_{n}$ contains eith…

math.CO2018

Matching preclusion number of graphs

Zhao Wang, Yaping Mao, Eddie Cheng +1

The \emph{matching preclusion number} of a graph $G$ , denoted by $\mpo(G)$, is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor…

math.CO2018★ 7 cited

Gallai-Ramsey numbers of odd cycles

Zhao Wang, Yaping Mao, Colton Magnant +2

Given two graphs $G$ and $H$ and a positive integer $k$ , the $k$ -color Gallai-Ramsey number, denoted by $g r_{k} (G : H)$ , is the minimum integer $N$ such that for all $n \geq N$ , ev…

math.CO2018

Gallai-Ramsey numbers for books

Jinyu Zou, Yaping Mao, Colton Magnant +2

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…