Tianheng Wang

collaborators

4 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

Books versus Triangles near the n/6 Threshold

Kaizhe Chen, Jie Ma, Tianhen Wang

The book number $b (G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every $n$ -vertex g…

math.CO2024

Uniquely colorable hypergraphs

Xizhi Liu, Jie Ma, Tianhen Wang +1

An $r$ -uniform hypergraph is uniquely $k$ -colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from eac…