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

2 papers · 1 filter

math.CO2023

A stability result for $C_{2 k + 1}$ -free graphs

Sijie Ren, Jian Wang, Shipeng Wang +1

A graph $G$ is called $C_{2 k + 1}$ -free if it does not contain any cycle of length $2 k + 1$ . In 1981, Haggkvist, Faudree and Schelp showed that every $n$ -vertex triangle-free graph wit…

math.CO2023

Four-vertex traces of finite sets

Peter Frankl, Jian Wang

Let $[n] = X_{1} \cup X_{2} \cup X_{3}$ be a partition with $⌊ \frac{n}{3} ⌋ \leq ∣ X_{i} ∣ \leq ⌈ \frac{n}{3} ⌉$ and define $\mathcal{G}=\{G\subset [n]\colon |G\cap X_i|\leq 1,…

A stability result for C2k+1​-free graphs

Four-vertex traces of finite sets

A stability result for $C_{2 k + 1}$ -free graphs