Jian Wang

collaborators

3 papers

math.CO2025

Hypergraph Turán problem of the generalized triangle with bounded matching number

Jian Wang, Wenbin Wang, Weihua Yang

Let $H$ be a 3-graph on $n$ vertices. The matching number $ν (H)$ is defined as the maximum number of disjoint edges in $H$ . The generalized triangle $…

math.CO2024

The maximum sturdiness of intersecting families

Peter Frankl, Jian Wang

Given a family $F \subset 2^{[n]}$ and $1 \leq i \neq = j \leq n$ , we use $F (i ˉ, j)$ to denote the family $\{F\setminus \{j\}\colon F\in \mathcal{F},\ F\cap \{i,j…

math.CO2024

Andrásfai--Erdős--Sós theorem for the generalized triangle

Xizhi Liu, Sijie Ren, Jian Wang

The celebrated Andrásfai--Erdős--Sós Theorem from 1974 shows that every $n$ -vertex triangle-free graph with minimum degree greater than $2 n /5$ must be bipartite. Its extensions to…