activity
20242026
collaborators

13 papers

math.CO2026

Asymptotically sharp bounds for affine subspace statistics in

Ting-Wei Chao, Zixuan Xu, Dmitrii Zakharov

Given a subset , we can consider the distribution of the intersection size of with a uniformly random -flat . Motivated by the edge statistics…

math.CO2026

Vertex-minor universality of a random graph

Ting-Wei Chao, Zixuan Xu

Given a graph and a vertex , a local complementation at on is an operation that replaces the induced graph on the neighborhood of by its complement. A gr…

math.CO2026

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…

math.CO2026

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

Ting-Wei Chao, Zichao Dong, Hong Liu +2

We study the Zarankiewicz problem for -partite, -uniform intersection hypergraphs arising from families of axis-parallel boxes in with prescribed direction…

math.CO2026

Uniform Set Systems with Uniform Witnesses

Ting-Wei Chao, Zixuan Xu, Dmitrii Zakharov

Frankl--Pach and Erdős conjectured that any -uniform set family with VC-dimension at most has size at most when…

math.CO2026

Finite field Nikodym problem for spread line sets

Ting-Wei Chao, Hung-Hsun Hans Yu

A set of points is a Nikodym set if, for any , there is a line through such that . We con…