5 papers
Exact Periodicity, Surjectivity, and a Haar Limit Law for a Restarting Josephus Process
Lizhong Chen
We study a restarting Josephus process in which the participants retain their linear order and counting restarts at the current leftmost survivor after every deletion. For step siz…
An infinite family of minimally nonperfectly divisible graphs with a bisimplicial vertex
Lizhong Chen
We disprove Hoàng's conjecture that a minimally nonperfectly divisible graph cannot contain a bisimplicial vertex by constructing an explicit infinite family. For every integer $t\…
Improved chromatic bounds for ()-free graphs
Lizhong Chen
Let be a -free graph, and let . We prove that \[ Ï(G)\leq \binom{k+2}{3}-\binom{k-1}{2} =\frac{k^3+11k-6}{6}. \] The previously best-known genera…
Optimal chromatic bound for (, HVN)-free graphs
Lizhong Chen, Hongyang Wang
The HVN is a graph formed by removing two edges incident to the same vertex from the complete graph . In this paper, we prove that every (, HVN)-free graph sa…
Perfect divisions in (, bull)-free graphs
Lizhong Chen, Hongyang Wang
A graph has a perfect division if its vertex set can be partitioned into two sets , such that is perfect and . We call perfectly divisible i…