Hung-Hsun Hans Yu

activity

20242026

collaborators

5 papers

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…

math.CO2026

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 sho…

math.CO2025

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…

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 Ec…

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…