Zhuo Wu

activity

20212026

most citedPositive co-degree Turán number for

C_{5}

and

C_{5}^{-}

2 citations · 4 across the 10 of their papers we have counts for

collaborators

Showing math.COShow all

12 papers · 1 filter

math.CO2026

Solution of uniform Turán's Tetrahedron Problem

Bartłomiej Kielak, Daniel Král, Ander Lamaison +3

Turán's Tetrahedron Problem asks to determine the Turán density of the complete hypergraph $K_{4}^{(3)}$ (tetrahedron). This problem, posed by Turán in 1941, is one of the most famou…

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

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.CO2025

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

Zhuo Wu, Yisai Xue

The chromatic threshold $δ_{χ} (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 bound…

math.CO2025

Stability with minuscule structure for chromatic thresholds

Jaehoon Kim, Hong Liu, Chong Shangguan +3

The chromatic threshold $δ_{χ} (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 boun…

math.CO2024

Clique density vs blowups

Domagoj Bradač, Hong Liu, Zhuo Wu +1

A well-known theorem of Nikiforov asserts that any graph with a positive $K_{r}$ -density contains a logarithmic blowup of $K_{r}$ . In this paper, we explore variants of Nikiforov's r…

math.CO2024

Empty red-red-blue triangles

Ting-Wei Chao, Zichao Dong, Zhuo Wu

Let $P$ be a $2 n$ -point set in the plane that is in general position. We prove that every red-blue bipartition of $P$ into $R$ and $B$ with $∣ R ∣ = ∣ B ∣ = n$ generates $Ω (n^{3/2})$ r…

math.CO2023

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$ . Fo…

math.CO2022★ 2 cited

Positive co-degree Turán number for $C_{5}$ and $C_{5}^{-}$

Zhuo Wu

The \emph{minimum positive co-degree} $δ_{r - 1}^{+} (H)$ of a non-empty $r$ -graph $H$ is the maximum $k$ such that if $S$ is an $(r - 1)$ -set contained in a hyperedge of $H$ , then $S$ …

math.CO2022

Disjoint isomorphic balanced clique subdivisions

Irene Gil Fernández, Joseph Hyde, Hong Liu +2

A thoroughly studied problem in Extremal Graph Theory is to find the best possible density condition in a host graph $G$ for guaranteeing the presence of a particular subgraph $H$ …

math.CO2021★ 2 cited

On the stability of graph independence number

Zichao Dong, Zhuo Wu

Let $G$ be a graph on $n$ vertices of independence number $α (G)$ such that every induced subgraph of $G$ on $n - k$ vertices has an independent set of size at least $α (G) - ℓ$ . Wh…

Solution of uniform Turán's Tetrahedron Problem

Abundance of Unique Subhypergraphs

Chromatic thresholds for pairs of graphs

Chromatic thresholds for linear equations and recurrence

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

Stability with minuscule structure for chromatic thresholds

Clique density vs blowups

Empty red-red-blue triangles

Counting cliques without generalized theta graphs

Positive co-degree Turán number for C5​ and C5−​

Disjoint isomorphic balanced clique subdivisions

On the stability of graph independence number

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

Positive co-degree Turán number for $C_{5}$ and $C_{5}^{-}$