Meiqiao Zhang

activity

20172026

P (G, L) - P (G, k)

for

k

-assignments

L

4 citations · 6 across the 15 of their papers we have counts for

collaborators

15 papers

math.CO2026

When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree

Meiqiao Zhang, Fengming Dong

Let $G$ be a simple graph with maximum degree $Δ \geq 3$ , and let $P (G, k)$ denote its chromatic polynomial. For each positive integer $k$ , the list-color function $P_{ℓ} (G, k)$ is…

math.CO2026

Real-rooted flow polynomials have only integral roots

Meiqiao Zhang, Fengming Dong

Let $G$ be a connected bridgeless graph. In 2011, Kung and Royle showed that all roots of the flow polynomial $F (G, λ)$ of $G$ are integers if and only if $G$ is the dual of a chord…

math.CO2026

Non-persistence of equality between chromatic polynomials and list-color functions

Meiqiao Zhang, Fengming Dong

For any graph $G$ , let $P (G, k)$ and $P_{ℓ} (G, k)$ denote the chromatic polynomial and the list-color function of $G$ , respectively. It remains an open problem whether, for every…

math.CO2025

A study on $T$ -equivalent graphs

Fengming Dong, Meiqiao Zhang

In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs $T$ -equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that grap…

math.CO2023

On the colorability of bi-hypergraphs

Meiqiao Zhang, Fengming Dong, Ruixue Zhang

A {\it mixed hypergraph} $H = (V, C, D)$ consists of the vertex set $V$ and two families of subsets of $2^{V}$ : the family $C$ of co-edge…

math.CO2023

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions

Meiqiao Zhang, Fengming Dong

In 2013, Ku and Wong showed that for any partitions $μ$ and $μ^{'}$ of a positive integer $n$ with the same first part $u$ and the lexicographic order $μ ◃ μ^{'}$ , the eigenva…

math.CO2023

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials

Fengming Dong, Meiqiao Zhang

In [J. Combin. Theory Ser. B 161 (2023), 109--119], the authors showed that the list-color function $P_{l} (G, k)$ of any simple graph $G$ of size $m$ coincides with its chromatic poly…

math.CO2023

Compare list-color functions of uniform hypergraphs with their chromatic polynomials (II)

Meiqiao Zhang, Fengming Dong

For any $r$ -uniform hypergraph $H$ with $m$ ( $\geq 2$ ) edges, let $P (H, k)$ and $P_{l} (H, k)$ be the chromatic polynomial and the list-color function of $…

math.CO2022

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)

Fengming Dong, Meiqiao Zhang

For a hypergraph $H$ , let $P (H, k)$ and $P_{l} (H, k)$ be its chromatic polynomial and list-color function respectively, and let $τ^{'} (H)$ be the least non-neg…

math.CO2022★ 4 cited

An improved lower bound of $P (G, L) - P (G, k)$ for $k$ -assignments $L$

Fengming Dong, Meiqiao Zhang

Let $G = (V, E)$ be a simple graph with $n$ vertices and $m$ edges, $P (G, k)$ be the chromatic polynomial of $G$ , and $P (G, L)$ be the number of $L$ -colorings of $G$ for any $k$ -assignm…

math.CO2022

DP color functions versus chromatic polynomials (II)

Meiqiao Zhang, Fengming Dong

For any connected graph $G$ , let $P (G, m)$ and $P_{D P} (G, m)$ denote the chromatic polynomial and DP color function of $G$ , respectively. It is known that $P_{D P} (G, m) \leq P (G, m)$ hol…

math.CO2021

Anti-Ramsey numbers for trees in complete multi-partite graphs

Meiqiao Zhang, Fengming Dong

Let $G$ be a complete multi-partite graph of order $n$ . In this paper, we consider the anti-Ramsey number $a r (G, T_{q})$ with respect to $G$ and the set $T_{q}$ …

math.CO2021

$Z_{D P} (n)$ is upperly bounded by $n^{2} - (n + 3) /2$

Meiqiao Zhang, Fengming Dong

DP-coloring was introduced by Dvořák and Postle and is a generalization of proper coloring. For any graph $G$ , let $χ (G)$ and $χ_{D P} (G)$ denote the chromatic number and the DP-chr…

math.CO2018

Zero-free intervals of chromatic polynomials of mixed hypergraphs

Ruixue Zhang, Fengming Dong

In this paper, we prove that $(- \infty, 0)$ is a zero-free interval for chromatic polynomials of a family $L_{0}$ of hypergraphs and $(0, 1)$ is a zero-free interval for chrom…

math.GT2017★ 2 cited

The Minimal Coloring Number Of Any Non-splittable $Z$ -colorable Link Is Four

Meiqiao Zhang, Xian'an Jin, Qingying Deng

K. Ichihara and E. Matsudo introduced the notions of $Z$ -colorable links and the minimal coloring number for $Z$ -colorable links, which is one of invariants for l…

When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree

Real-rooted flow polynomials have only integral roots

Non-persistence of equality between chromatic polynomials and list-color functions

A study on T-equivalent graphs

On the colorability of bi-hypergraphs

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials

Compare list-color functions of uniform hypergraphs with their chromatic polynomials (II)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)

An improved lower bound of P(G,L)−P(G,k) for k-assignments L

DP color functions versus chromatic polynomials (II)

Anti-Ramsey numbers for trees in complete multi-partite graphs

ZDP​(n) is upperly bounded by n2−(n+3)/2

Zero-free intervals of chromatic polynomials of mixed hypergraphs

The Minimal Coloring Number Of Any Non-splittable Z-colorable Link Is Four

A study on $T$ -equivalent graphs

An improved lower bound of $P (G, L) - P (G, k)$ for $k$ -assignments $L$

$Z_{D P} (n)$ is upperly bounded by $n^{2} - (n + 3) /2$

The Minimal Coloring Number Of Any Non-splittable $Z$ -colorable Link Is Four