Zimu Xiang

collaborators

6 papers

math.CO2026

DP vertex-arboricity of sparse graphs

Peter Bradshaw, Alexandr Kostochka, Zimu Xiang

The vertex arboricity $va (G)$ of a multigraph $G$ is the minimum number $k$ for which $V (G)$ can be partitioned into $k$ subsets, each of which induces an acyclic subgraph…

math.CO2026

An introduction to equitable DP coloring of graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper $k$ -coloring of vertices of an $n$ -vertex graph is equitable if the size of every color class is $⌊ n / k ⌋$ or $⌈ n / k ⌉$ . An extension of it to list col…

math.CO2026

On the TurÃ¡nability and tileability of oriented graphs

Igor Araujo, Zimu Xiang

An oriented graph $H$ is TurÃ¡nable (resp. tileable) if there exist $n_{0} \in N$ such that every semi-regular near-tournament on $n \geq n_{0}$ vertices contains a copy of $H$ …

math.CO2025

Equitable list coloring of sparse graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper vertex coloring of a graph is equitable if the sizes of all color classes differ by at most $1$ . For a list assignment $L$ of $k$ colors to each vertex of an $n$ -vertex gr…

math.CO2025

On Relative Ordered TurÃ¡n Density

Dylan King, Bernard LidickÃ½, Minghui Ouyang +3

For an ordered graph $F$ , denote the TurÃ¡n density by $I ¨ (F)$ . The relative TurÃ¡n density, denoted by $I ¨ (F)$ , is the supremum over $I^\pm \in [0, 1]$ such that every ordered grap…

math.CO2025

Results and Problems on Equitable Coloring of Graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themse…