Hanzhi Bai

collaborators

3 papers

math.CO2026

Packing and Covering Cycles Through Prescribed Vertices

Hanzhi Bai, Jin Yan

Let $G$ be a finite simple graph and let $S \subseteq V (G)$ . We prove that the minimum number of vertices meeting every cycle that intersects $S$ is at most the maximum number of ve…

cs.DM2026

Polynomial Algorithms for Minimum Degree Partitions in Semicomplete Digraphs

Hanzhi Bai, Jin Yan

A 2-partition of a digraph is a partition of its vertex set into two nonempty parts. Degree-constrained 2-partition problems are generally computationally difficult, even when the…

math.CO2026

New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers

Hanzhi Bai, Longma Du, Xinyu Hu +2

The Ramsey number $r_{k} (s, m)$ is the smallest $N$ such that any red/blue coloring of the $k$ -subsets of $[N]$ contains a red $s$ -set or a blue $m$ -set. For fixed $k$ and $s$ , and fo…