Jiabao Yang

collaborators

2 papers

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$ conta…

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

A note on long nontrivial cycle in Hamiltonian graphs

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