Tingzeng Wu

works on

combinatorial bounds 1 critical hypergraphs 1 extremal hypergraph theory 1 intersecting families 1 t-intersecting 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

An improved range for the maximum critically $t$ -intersecting hypergraphs

Lu Lu, Rongrong Lu, Qifan Wang +1

The paper proves that for k-uniform hypergraphs that are t‑intersecting and t‑critical, the maximum number of edges is bounded by $\binom{k+d}{d}$ when k > 30·d², confirming Fran…

math.CO2026

Thresholds for the Frankl-Wang $3/7$ conjecture on maximum-degree ratios

Zejun Huang, Zhiyi Liu, Lu Lu +1

Let $F \subset (k [ n ])$ be an intersecting family, $I^ (F) = max_{x \in [n]} ∣ {F \in F : x \in F} ∣$ , and $\varrho(\mathcal{F})=Î(\mathcal{F})/|\mathcal{…

math.CO2026

BollobÃ¡s-type inequalities for subspaces via weight invariance

Zhiyi Liu, Lihua Feng, Tingzeng Wu

Let $V$ be an $n$ -dimension real vector space with a direct sum decomposition $V = V_{1} \oplus \dots \oplus V_{r}$ . Let $P = {(A_{i}, B_{i}) : i \in [m]}$ be a skew BollobÃ¡s…

math.CO2025

The number of rooted spanning forests of bicirculant graphs

Jing Yang, Lihua Feng, Rongrong Lu +1

A bi-Cayley graph over the cyclic group $(Z_{n}, +)$ is called a bicirculant graph. Let $I^ = B C (Z_{n}; R, T, S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\…

An improved range for the maximum critically t-intersecting hypergraphs

Thresholds for the Frankl-Wang 3/7 conjecture on maximum-degree ratios

BollobÃ¡s-type inequalities for subspaces via weight invariance

The number of rooted spanning forests of bicirculant graphs

An improved range for the maximum critically $t$ -intersecting hypergraphs

Thresholds for the Frankl-Wang $3/7$ conjecture on maximum-degree ratios