Rong Chen

most citedBorodin-Kostochka Conjecture holds for odd-hole-free graphs

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

collaborators

3 papers

math.CO2024

On the total number of ones associated with cranks of partitions modulo 11

Dandan Chen, Rong Chen, Siyu Yin

In 2021, Andrews mentioned that George Beck introduced partition statistics $M_{w} (r, m, n)$ , which denote the total number of ones in the partition of $n$ with crank congruent to $r$ …

math.NT2024

Transformation properties of Andrews-Beck $N T$ functions and generalized Appell-Lerch series

Rong Chen, Xiao-Jie Zhu

In 2021, Andrews mentioned that George Beck introduced a partition statistic $N T (r, m, n)$ which is related to Dyson's rank statistic. Motivated by Andrews's work, scholars have esta…

math.CO2023★ 1 cited

Borodin-Kostochka Conjecture holds for odd-hole-free graphs

Rong Chen, Kaiyang Lan, Xinheng Lin +1

The Borodin-Kostochka Conjecture states that for a graph $G$ , if $Δ (G) \geq 9$ , then $χ (G) \leq max {Δ (G) - 1, ω (G)}$ . In this paper, we prove the Borodin-Kostochka Conjecture holding…

On the total number of ones associated with cranks of partitions modulo 11

Transformation properties of Andrews-Beck NT functions and generalized Appell-Lerch series

Borodin-Kostochka Conjecture holds for odd-hole-free graphs

Transformation properties of Andrews-Beck $N T$ functions and generalized Appell-Lerch series