H. Yu

activity

20232026

most citedDeciding Foot-sortability and Minimal 2-bounded Non-foot-sortable Sock Orderings

1 citations · 1 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2026

The Erdős distinct distances problem in $R^{3}$

Jonathan Tidor, Hung-Hsun Hans Yu, Dmitrii Zakharov

We prove that $N$ points in $R^{3}$ determine at least $N^{2/3 - o (1)}$ distinct distances.

math.CO2026

$K_{2, t + 1}$ -free graphs with many copies of $K_{t, t}$

Cosmin Pohoata, Jonathan Tidor, Hung-Hsun Hans Yu

For every fixed integer $t \geq 3$ , we construct an $n$ -vertex $K_{2, t + 1}$ -free graph containing $Ω_{t} (n^{2})$ copies of $K_{t, t}$ . Combined with a simple counting argument, this shows…

math.CO2025

Polynomial-to-exponential transition in 3-uniform Ramsey numbers

Ruben Ascoli, Xiaoyu He, Hung-Hsun Hans Yu

Let $r_{k} (s, e; t)$ denote the smallest $N$ such that any red/blue edge coloring of the complete $k$ -uniform hypergraph on $N$ vertices contains either $e$ red edges among some $s$ …

math.CO2025

Off-Diagonal Ramsey Numbers for Linear Hypergraphs

Xiaoyu He, Jiaxi Nie, Yuval Wigderson +1

We study off-diagonal Ramsey numbers $r (H, K_{n}^{(k)})$ of $k$ -uniform hypergraphs, where $H$ is a fixed linear $k$ -uniform hypergraph and $K_{n}^{(k)}$ is complete on $n$ vertices. R…

math.CO2024

When are off-diagonal hypergraph Ramsey numbers polynomial?

David Conlon, Jacob Fox, Benjamin Gunby +5

A natural open problem in Ramsey theory is to determine those $3$ -graphs $H$ for which the off-diagonal Ramsey number $r (H, K_{n}^{(3)})$ grows polynomially with $n$ . We make substan…

math.CO2024

On the structure of extremal point-line arrangements

Gabriel Currier, Jozsef Solymosi, Hung-Hsun Hans Yu

In this note, we show that extremal Szemerédi-Trotter configurations are rigid in the following sense: If $P, L$ are sets of points and lines determining at least $C|P|^{2/3}|L|^{2/…

math.CO2024

Multilevel polynomial partitioning and semialgebraic hypergraphs: regularity, Turán, and Zarankiewicz results

Jonathan Tidor, Hung-Hsun Hans Yu

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$ -uniform semi…

math.CO2023★ 1 cited

Deciding Foot-sortability and Minimal 2-bounded Non-foot-sortable Sock Orderings

Hung-Hsun Hans Yu

A sock ordering is a sequence of socks with different colors. A sock ordering is foot-sortable if the sequence of socks can be sorted by a stack so that socks with the same color f…

The Erdős distinct distances problem in R3

K2,t+1​-free graphs with many copies of Kt,t​

Polynomial-to-exponential transition in 3-uniform Ramsey numbers

Off-Diagonal Ramsey Numbers for Linear Hypergraphs

When are off-diagonal hypergraph Ramsey numbers polynomial?

On the structure of extremal point-line arrangements

Multilevel polynomial partitioning and semialgebraic hypergraphs: regularity, Turán, and Zarankiewicz results

Deciding Foot-sortability and Minimal 2-bounded Non-foot-sortable Sock Orderings

The Erdős distinct distances problem in $R^{3}$

$K_{2, t + 1}$ -free graphs with many copies of $K_{t, t}$