Jie Ma

collaborators

5 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…

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

A Hypergraph Container Method for Spread SAT: Approximation and Speedup

Zicheng Han, Yupeng Lin, Jie Ma +1

We develop a hypergraph container method for the Boolean Satisfiability Problem (SAT) via the newly developed container results [Campos and Samotij (2026)]. This provides an explic…

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

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