Chi Hoi Yip

most citedThe Frankl-Pach upper bound is not tight for any uniformity

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026★ 1 cited

The Frankl-Pach upper bound is not tight for any uniformity

Gennian Ge, Zixiang Xu, Chi Hoi Yip +2

For any positive integers $n \geq d + 1 \geq 3$ , what is the maximum size of a $(d + 1)$ -uniform set system in $[n]$ with VC-dimension at most $d$ ? In 1984, Frankl and Pach initiated the s…

math.CO2026

An ErdÅs-Ko-Rado theorem for binary codes

Shamil Asgarli, Chi Hoi Yip

We study intersecting families of words from the ErdÅs-Ko-Rado perspective. When the alphabet size is $2$ , a maximum intersecting family is not necessarily a star. However, we pro…

math.CO2025

Uniform set systems with small VC-dimension

Ting-Wei Chao, Zixiang Xu, Chi Hoi Yip +1

We investigate the longstanding problem of determining the maximum size of a $(d + 1)$ -uniform set system with VC-dimension at most $d$ . Since the seminal 1984 work of Frankl and Pac…

The Frankl-Pach upper bound is not tight for any uniformity

An ErdÅs-Ko-Rado theorem for binary codes

Uniform set systems with small VC-dimension

An ErdÅs-Ko-Rado theorem for binary codes