Tianming Zhu

activity

20242026

collaborators

7 papers

math.CO2026

On clique-to-clique densities

Jie Ma, Tianhen Wang, Tianming Zhu

Let $k_{r} (G)$ denote the number of $r$ -cliques in a graph $G$ and let $F_{r} (\cdot)$ be the Lovász--Simonovits $r$ -clique density function. For any integers $2 \leq s < t$ , we determine t…

math.CO2026

On a hypergraph Turán problem of Balogh-Bohman-Bollobás-Zhao

Heng Li, Jie Ma, Tianhen Wang +2

Let $S$ and $T$ be disjoint sets with $∣ S ∣ = i$ and $∣ T ∣ = r - 1$ for $2 \leq i \leq r - 1$ , and let $B_{i}^{(r)}$ be the $r$ -graph on $S \cup T$ whose edges are the $r$ -subsets containing $S$ or…

math.CO2026

Upper Bounds on Turán Densities via Extremal Set Theory

Yaobin Chen, Xizhi Liu, Ningyuan Yang +1

We exhibit, in a systematic way, connections between hypergraph Turán problems and extremal set theory. More specifically, we construct natural families of uniform hypergraphs for…

math.CO2026

The inducibility of Turán graphs

Xizhi Liu, Jie Ma, Tianming Zhu

Let $I (F, n)$ denote the maximum number of induced copies of a graph $F$ in an $n$ -vertex graph. The inducibility of $F$ , defined as $i (F) = lim_{n \to \infty} I (F, n) / (v ( F ) n)$ …

math.CO2025

Odd hypergraph Mantel theorems

Jianfeng Hou, Xizhi Liu, Yixiao Zhang +2

A classical result of Sidorenko (1989) shows that the Turán density of every $r$ -uniform hypergraph with three edges is bounded from above by $1/2$ . For even $r$ , this bound is tig…

math.CO2025

A note on hypergraph extensions of Mantel's theorem

Jie Ma, Tianming Zhu

Chao and Yu introduced an entropy method for hypergraph Turán problems, and used it to show that the family of $⌊ k /2 ⌋$ $k$ -uniform tents have Turán density $k! / k^{k}$ . I…