Shuaichao Wang

activity

20232026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

Ting-Wei Chao, Zichao Dong, Hong Liu +2

We study the Zarankiewicz problem for $r$ -partite, $r$ -uniform intersection hypergraphs arising from $r$ families of axis-parallel boxes in $R^{d}$ with prescribed direction…

math.CO2024

Separating hypergraph Turán densities

Hong Liu, Bjarne Schülke, Shuaichao Wang +2

Determining the Turán densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Turán posed this problem in 1941, $π (K_{ℓ}^{(k)})$ remai…

math.CO2024

On $3$ -graphs with vanishing codegree Turán density

Laihao Ding, Ander Lamaison, Hong Liu +2

For a $k$ -uniform hypergraph (or simply $k$ -graph) $F$ , the codegree Turán density $π_{co} (F)$ is the supremum over all $α$ such that there exist arbitrarily large $n$ -ver…

math.CO2023

Vanishing codegree Turán density implies vanishing uniform Turán density

Laihao Ding, Hong Liu, Shuaichao Wang +1

For a $k$ -uniform hypergraph (or simply $k$ -graph) $F$ , the codegree Turán density $π_{co} (F)$ is the infimum over all $α$ such that any $n$ -vertex $k$ -graph $H$ with ever…

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes

Separating hypergraph Turán densities

On 3-graphs with vanishing codegree Turán density

Vanishing codegree Turán density implies vanishing uniform Turán density

On $3$ -graphs with vanishing codegree Turán density