Jian Wang

activity

20122026

most citedThe formula for Turán number of spanning linear forests

18 citations · 33 across the 23 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

On the Maximum Number of Edges in Hypergraphs with Fixed Matching and Clique Number

Peter Frankl, Erica L. L. Liu, Jian Wang

For a $k$ -graph $F \subset (k [ n ])$ , the clique number of $F$ is defined to be the maximum size of a subset $Q$ of $[n]$ with $\binom{Q}{k}\subset \mathca…

math.CO2020★ 1 cited

A Stability Theorem for Maximal $C_{2 k + 1}$ -free Graphs

Jian Wang, Shipeng Wang, Weihua Yang +1

For any positive integer $k$ , we show that every maximal $C_{2 k + 1}$ -free graph with at least $n^{2} /4 - o (n^{3/2})$ edges contains an induced complete bipartite subgraph on $(1 - o (1)) n$ …

math.CO2020★ 1 cited

The Maximum Number of Cliques in Hypergraphs without Large Matchings

Erica L. L. Liu, Jian Wang

Let $[n]$ denote the set ${1, 2, \dots, n}$ and $F_{n, k, a}^{(r)}$ be an $r$ -uniform hypergraph on the vertex set $[n]$ with edge set consisting of all the $r$ -element…

On the Maximum Number of Edges in Hypergraphs with Fixed Matching and Clique Number

A Stability Theorem for Maximal C2k+1​-free Graphs

The Maximum Number of Cliques in Hypergraphs without Large Matchings

A Stability Theorem for Maximal $C_{2 k + 1}$ -free Graphs