Zhuo Wu

activity

20242026

collaborators

8 papers

math.CO2026

Chromatic thresholds for linear equations and recurrence

Hong Liu, Zhuo Wu, Ningyuan Yang +1

Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $F_{p}$ . Given a homogeneous equation…

math.CO2026

Abundance of Unique Subhypergraphs

Xichao Shu, Zhuo Wu, Yisai Xue

Given $k$ -uniform hypergraphs $G$ and $H$ , we say that $G$ is a unique subhypergraph of $H$ if $H$ contains exactly one subhypergraph isomorphic to $G$ . For an $n$ -vertex $k$ -graph…

math.CO2026

Chromatic thresholds for pairs of graphs

Jun Gao, Hong Liu, Zhuo Wu +1

The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$ -free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs…

math.CO2026

Counting cliques without generalized theta graphs

Jun Gao, Zhuo Wu, Yisai Xue

The \textit{generalized TurÃ¡n number} $ex (n, T, F)$ is the maximum possible number of copies of $T$ in an $F$ -free graph on $n$ vertices for any two graphs $T$ and $F$ . F…

math.CO2026

Stability with minuscule structure for chromatic thresholds

Jaehoon Kim, Hong Liu, Chong Shangguan +3

The chromatic threshold $I^´_{I ¨} (H)$ of a graph $H$ is the infimum of $d > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $d n$ is bo…

math.CO2025

Edge density and minimum degree thresholds for $H$ -free graphs with unbounded chromatic number

Zhuo Wu, Yisai Xue

The chromatic threshold $I^´_{I ¨} (H)$ of a graph $H$ is the infimum of $d > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $d n$ is bou…

Chromatic thresholds for linear equations and recurrence

Abundance of Unique Subhypergraphs

Chromatic thresholds for pairs of graphs

Counting cliques without generalized theta graphs

Stability with minuscule structure for chromatic thresholds

Edge density and minimum degree thresholds for H-free graphs with unbounded chromatic number

Edge density and minimum degree thresholds for $H$ -free graphs with unbounded chromatic number