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

Showing 2026Show all

2 papers · 1 filter

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…

The Erdős distinct distances problem in R3

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

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

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