Hung-Hsun Yu

activity

20242026

collaborators

5 papers

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 $I^c ◯_{t} (n^{2})$ copies of $K_{t, t}$ . Combined with a simple counting argument, this show…

math.CO2025

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.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

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…

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

When are off-diagonal hypergraph Ramsey numbers polynomial?

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

Off-Diagonal Ramsey Numbers for Linear Hypergraphs

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

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