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 2024Show all

5 papers · 1 filter

math.CO2024

When entropy meets Turán: new proofs and hypergraph Turán results

Ting-Wei Chao, Hung-Hsun Hans Yu

In this paper, we provide a new proof of a density version of Turán's theorem. We also rephrase both the theorem and the proof using entropy. With the entropic formulation, we show…

math.CO2024

Many cliques with small degree powers

Ting-Wei Chao, Zichao Dong, Zijun Shen +1

Suppose $0 < p \leq \infty$ . For a simple graph $G$ with a vertex-degree sequence $d_{1}, \dots, d_{n}$ satisfying $(d_{1}^{p} + \dots + d_{n}^{p})^{1/ p} \leq C$ , we prove asymptotically sharp u…

math.CO2024

When Joints Meet Extremal Graph Theory: Hypergraph Joints

Ting-Wei Chao, Hung-Hsun Hans Yu

The Kruskal--Katona theorem determines the maximum number of $d$ -cliques in an $n$ -edge $(d - 1)$ -uniform hypergraph. A generalization of the theorem was proposed by Bollobás and Ecc…

math.CO2024

Empty red-red-blue triangles

Ting-Wei Chao, Zichao Dong, Zhuo Wu

Let $P$ be a $2 n$ -point set in the plane that is in general position. We prove that every red-blue bipartition of $P$ into $R$ and $B$ with $∣ R ∣ = ∣ B ∣ = n$ generates $Ω (n^{3/2})$ r…

math.CO2024

A Purely Entropic Approach to the Rainbow Triangle Problem

Ting-Wei Chao, Hung-Hsun Hans Yu

In this short note, we present a purely entropic proof that in a $3$ -edge-colored simple graph with $R$ red edges, $G$ green edges, and $B$ blue edges, the number of rainbow triang…