Jiabao Yang

collaborators

4 papers

math.CO2026

Clique-saturating non-edges throughout the Turán range

Xiaolin Wang, Jiabao Yang, Ruilin Zheng

For an $F$ -free graph $G$ , a non-edge is $F$ -saturating if adding it to $G$ creates a copy of $F$ . We denote by $f_{p + 1} (n, m)$ the minimum number of $K_{p + 1}$ -saturating non-edges…

math.CO2026

Near-optimal Turán densities of $r$ -graphs on $r + 1$ vertices

Jiabao Yang, Xiutao Zhu

Let $π (H)$ be the Turán density of an r-uniform hypergraph $H$ and let $H_{k}^{r}$ denote the $r$ -uniform hypergraph on $r + 1$ vertices with exactly $k$ edges, where $1 \leq k \leq r + 1$ . Si…

math.CO2026

Intersecting families of sets are usually trivial for $n \geq 2 k + 3$

Jiabao Yang

A family of subsets of $[n]$ is called intersecting if it contains no pair of disjoint sets. It is called trivial if all its members contain a common element. Frankl and Kupavskii,…

math.CO2026

A note on long nontrivial cycle in Hamiltonian graphs

Xiaolin Wang, Jiabao Yang, Guangmiao Yu +1

Let $G$ be an $n$ -vertex graph containing a Hamiltonian cycle and with minimum degree at least $3$ . Girão, Kittipassorn and Narayanan (Israel J. Math., 2019) proved that $G$ contai…

Clique-saturating non-edges throughout the Turán range

Near-optimal Turán densities of r-graphs on r+1 vertices

Intersecting families of sets are usually trivial for n≥2k+3

A note on long nontrivial cycle in Hamiltonian graphs

Near-optimal Turán densities of $r$ -graphs on $r + 1$ vertices

Intersecting families of sets are usually trivial for $n \geq 2 k + 3$