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 2018Show all

5 papers · 1 filter

math.CO2018

The maximum number of triangles in graphs without large linear forests

Xiuzhuan Duan, Jian Wang, Weihua Yang

Let $G$ be a graph on $n$ vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of $G$ is a subgraph of $G$ with m…

math.CO2018

The Turán problem for a family of tight linear forests

Jian Wang, Weihua Yang

Let $F$ be a family of $r$ -graphs. The Turán number $e x_{r} (n; F)$ is defined to be the maximum number of edges in an $r$ -graph of order $n$ that is $F$ -…

math.CO2018★ 1 cited

The shifting method and generalized Turán number of matchings

Jian Wang

Given two graphs $T$ and $F$ , the maximum number of copies of $T$ in an $F$ -free graph on $n$ vertices is called the generalized Turán number, denoted by $e x (n, T, F)$ . When $T = K_{2}$ ,…

math.CO2018★ 18 cited

The formula for Turán number of spanning linear forests

Bo Ning, Jian Wang

Let $F$ be a family of graphs. The Turán number $e x (n; F)$ is defined to be the maximum number of edges in a graph of order $n$ that is $F$ -free. In 19…

math.CO2018

The Turán Number for Spanning Linear Forests

Jian Wang, Weihua Yang

For a set of graphs $F$ , the extremal number $e x (n; F)$ is the maximum number of edges in a graph of order $n$ not containing any subgraph isomorphic to some gra…