Xin Zhang

activity

20242026

most citedEquitable coloring of sparse graphs

1 citations · 1 across the 11 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

An improved upper bound for the planar Turán number of $C_{8}$

Xuqing Bai, Weichan Liu, Xiangxiang Nie +1

We prove that every $n$ -vertex simple planar graph with no copy of $C_{8}$ has at most \[ \frac{69}{25}(n-2) \] edges, for every $n \geq 8$ . This improves the best known bound \[ \frac…

math.CO2026

Bootstrap percolation of extension hypergraphs

Weichan Liu, Bjarne Schülke, Xin Zhang

For $k$ -graphs $F$ and $H_{0}$ the $F$ -bootstrap percolation process (or $F$ -process) starting with $H_{0}$ is a sequence $(H_{i})_{i \geq 0}$ of $k$ -graphs such that $H_{i + 1}$ is obtained…

math.CO2026

Between proper and square colorings of planar graphs with maximum degree at most four

Xujun Liu, Zihui Xu, Xin Zhang

An $i$ -independent set is a vertex set whose pairwise distance is at least $i + 1$ . A proper (square) $k$ -coloring of a graph $G$ is a partition of its vertex set into $k$ independen…

math.CO2026

On $(1^{2}, 2^{2})$ -packing edge-coloring of sparse subcubic graphs

Xujun Liu, Jiacheng Yang, Xin Zhang

For positive integers $ℓ$ and $k$ , a $(1^{ℓ}, 2^{k})$ -packing edge-coloring of a graph $G$ is a partition of $E (G)$ into $ℓ$ matchings and $k$ induced matchings. A graph is $d…

An improved upper bound for the planar Turán number of C8​

Bootstrap percolation of extension hypergraphs

Between proper and square colorings of planar graphs with maximum degree at most four

On (12,22)-packing edge-coloring of sparse subcubic graphs

An improved upper bound for the planar Turán number of $C_{8}$

On $(1^{2}, 2^{2})$ -packing edge-coloring of sparse subcubic graphs