Jingmei Zhang

activity

20182021

collaborators

5 papers

math.CO2021

On the size of special class 1 graphs and $(P_{3}; k)$ -co-critical graphs

Gang Chen, Zhengke Miao, Zi-Xia Song +1

A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $Δ$ , then the chromatic index $χ^{'} (G)$ of $G$ is $Δ$ or $Δ + 1$ . A graph $G$ is class 1 if $χ'(…

math.CO2019

On the size of $(K_{t}, T_{k})$ -co-critical graphs

Zi-Xia Song, Jingmei Zhang

Given an integer $r \geq 1$ and graphs $G, H_{1}, \dots, H_{r}$ , we write $G \to (H_{1}, \dots, H_{r})$ if every $r$ -coloring of the edges of $G$ contains a monochromatic copy o…

math.CO2018

Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$

Hui Lei, Yongtang Shi, Zi-Xia Song +1

A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai $k$ -coloring is a Gallai coloring that uses $k$ colors. Given an integer $k…

math.CO2018

Improved Upper Bounds for Gallai-Ramsey Numbers of Odd Cycles

Christian Bosse, Zi-Xia Song, Jingmei Zhang

A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai $k$ -coloring is a Gallai coloring that uses $k$ colo…

math.CO2018

A conjecture on Gallai-Ramsey numbers of even cycles and paths

Zi-Xia Song, Jingmei Zhang

A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai $k$ -coloring is a Gallai coloring that uses at most $k$ colors. Given an in…

On the size of special class 1 graphs and (P3​;k)-co-critical graphs

On the size of (Kt​,Tk​)-co-critical graphs

Gallai-Ramsey numbers of C10​ and C12​

Improved Upper Bounds for Gallai-Ramsey Numbers of Odd Cycles

A conjecture on Gallai-Ramsey numbers of even cycles and paths

On the size of special class 1 graphs and $(P_{3}; k)$ -co-critical graphs

On the size of $(K_{t}, T_{k})$ -co-critical graphs

Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$