Ting-Wei Chao

activity

20202026

most citedKruskal--Katona-Type Problems via the Entropy Method

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

collaborators

Showing 2026Show all

7 papers · 1 filter

math.CO2026

On Colorful Kruskal--Katona Theorems

Ting-Wei Chao, Maya Sankar, Hung-Hsun Hans Yu

What is the maximum number of rainbow triangles in an edge-colored graph with $m$ edges and $r$ colors? Using entropic techniques, we prove an upper bound of $C_{r} m^{3/2}$ rainbow t…

math.CO2026

Asymptotics of the Brown--Erdős--Sós problem at integer exponents

Ting-Wei Chao, Xinqi Huang, Hong Liu

The Brown--Erdős--Sós problem is a fundamental problem in sparse hypergraph Turán theory. For integers $r, k \geq 2$ and $s \geq r$ , the problem asks for the maximum number $f^{(r)}(n;s…

math.CO2026

Asymptotically sharp bounds for affine subspace statistics in $F_{2}^{n}$

Ting-Wei Chao, Zixuan Xu, Dmitrii Zakharov

Given a subset $A \subseteq F_{2}^{n}$ , we can consider the distribution of the intersection size of $A$ with a uniformly random $d$ -flat $F$ . Motivated by the edge statistics…

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 $r$ -partite, $r$ -uniform intersection hypergraphs arising from $r$ families of axis-parallel boxes in $R^{d}$ 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 $(d + 1)$ -uniform set family $F \subseteq (d + 1 [ n ])$ with VC-dimension at most $d$ has size at most $(d n - 1)$ when…

math.CO2026

Vertex-minor universality of a random graph

Ting-Wei Chao, Zixuan Xu

Given a graph $G$ and a vertex $v \in V (G)$ , a local complementation at $v$ on $G$ is an operation that replaces the induced graph on the neighborhood of $v$ by its complement. A gr…

math.CO2026

Finite field Nikodym problem for spread line sets

Ting-Wei Chao, Hung-Hsun Hans Yu

A set of points $N \subseteq F_{q}^{d}$ is a Nikodym set if, for any $x \in F_{q}^{d}$ , there is a line $ℓ$ through $x$ such that $ℓ ∖ {x} \subseteq N$ . We con…

On Colorful Kruskal--Katona Theorems

Asymptotics of the Brown--Erdős--Sós problem at integer exponents

Asymptotically sharp bounds for affine subspace statistics in F2n​

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

Uniform Set Systems with Uniform Witnesses

Vertex-minor universality of a random graph

Finite field Nikodym problem for spread line sets

Asymptotically sharp bounds for affine subspace statistics in $F_{2}^{n}$