Biao Wu

most citedTuran numbers of extensions of some sparse hypergraphs via Lagrangians

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2017

Dense $3$ -uniform hypergraphs containing a large clique

Biao Wu, Yuejian Peng

An $r$ -uniform graph $G$ is dense if and only if every proper subgraph $G^{'}$ of $G$ satisfies $λ (G^{'}) < λ (G)$ , where $λ (G)$ is the Lagrangian of a hypergraph $G$ . In 1980's, Sidorenk…

math.CO2016★ 2 cited

Turan numbers of extensions of some sparse hypergraphs via Lagrangians

Tao Jiang, Yuejian Peng, Biao Wu

Given a positive integer $n$ and an $r$ -uniform hypergraph (or $r$ -graph for short) $F$ , the Turan number $e x (n, F)$ of $F$ is the maximum number of edges in an $r$ -graph on $n$ ver…

Dense 3-uniform hypergraphs containing a large clique

Turan numbers of extensions of some sparse hypergraphs via Lagrangians

Dense $3$ -uniform hypergraphs containing a large clique