5 citations · 14 across the 18 of their papers we have counts for
4 papers · 1 filter
Edge inducibility via local directed graphs
Ting-Wei Chao, Asaf Cohen Antonir, Anqi Li +1
In this paper we introduce the edge inducibility problem. This is a common refinement of both the well known Kruskal--Katona theorem and the inducibility question introduced by Pip…
The Oddtown problem modulo a composite number
Boris Bukh, Ting-Wei Chao, Zeyu Zheng
A family of subsets of an -element set is called an -Oddtown if the sizes of all sets are not divisible by , but the sizes of pairwise intersections ar…
Even-degeneracy of a random graph
Ting-Wei Chao, Dingding Dong, Zixuan Xu
A graph is even-degenerate if one can iteratively remove a vertex of even degree at each step until at most one edge remains. Recently, Janzer and Yip showed that the Erdős--Renyi…
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 -uniform set system with VC-dimension at most . Since the seminal 1984 work of Frankl and Pac…