Zi-Xia Song

activity

20152026

most citedBreaking the degeneracy barrier for coloring graphs with no

K_{t}

minor

24 citations · 111 across the 46 of their papers we have counts for

collaborators

Showing 2018Show all

9 papers · 1 filter

math.CO2018

Gallai-Ramsey number of odd cycles with chords

Fangfang Zhang, Zi-Xia Song, Yaojun Chen

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. For an inte…

math.CO2018★ 1 cited

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★ 7 cited

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

Saturation numbers for Ramsey-minimal graphs

Martin Rolek, Zi-Xia Song

Given graphs $H_{1}, \dots, H_{t}$ , a graph $G$ is $(H_{1}, \dots, H_{t})$ -Ramsey-minimal if every $t$ -coloring of the edges of $G$ contains a monochromatic $H_{i}$ in color $i$ for some $i\…

math.CO2018★ 3 cited

Extremal $H$ -free planar graphs

Yongxin Lan, Yongtang Shi, Zi-Xia Song

Given a graph $H$ , a graph is $H$ -free if it does not contain $H$ as a subgraph. We continue to study the topic of "extremal" planar graphs, that is, how many edges can an $H$ -free…

math.CO2018

Erdős-Lovász Tihany Conjecture for graphs with forbidden holes

Zi-Xia Song

A hole in a graph is an induced cycle of length at least $4$ . Let $s \geq 2$ and $t \geq 2$ be integers. A graph $G$ is $(s, t)$ -splittable if $V (G)$ can be partitioned into two sets $S$ …

math.CO2018★ 8 cited

Multicolor Gallai-Ramsey numbers of $C_{9}$ and $C_{11}$

Christian Bosse, Zi-Xia Song

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. We study Ramsey-typ…

math.CO2018★ 1 cited

Planar anti-Ramsey numbers of matchings

Gang Chen, Yongxin Lan, Zi-Xia Song

Given a positive integer $n$ and a planar graph $H$ , let $T_{n} (H)$ be the family of all plane triangulations $T$ on $n$ vertices such that $T$ contains a subgraph isomorph…

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…

Gallai-Ramsey number of odd cycles with chords

Gallai-Ramsey numbers of C10​ and C12​

Improved Upper Bounds for Gallai-Ramsey Numbers of Odd Cycles

Saturation numbers for Ramsey-minimal graphs

Extremal H-free planar graphs

Erdős-Lovász Tihany Conjecture for graphs with forbidden holes

Multicolor Gallai-Ramsey numbers of C9​ and C11​

Planar anti-Ramsey numbers of matchings

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

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

Extremal $H$ -free planar graphs

Multicolor Gallai-Ramsey numbers of $C_{9}$ and $C_{11}$