Haotian Yang

activity

20232026

collaborators

Showing 2024Show all

2 papers · 1 filter

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…

Separating hypergraph Turán densities

On 3-graphs with vanishing codegree Turán density

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