Shipeng Wang

activity

20202026

most citedA Stability Theorem for Maximal

C_{2 k + 1}

-free Graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2026

The homomorphism threshold of odd cycle $C_{2 k - 1}$ is below $\frac{1}{2 k - 1}$

Jian Wang, Shipeng Wang, Zixiang Xu

The homomorphism threshold $δ_{hom} (H)$ of a graph $H$ asks how large the minimum degree of an $H$ -free graph has to be in order to force a homomorphism to a bounded $H$ -fre…

math.CO2025

Longest odd cycles in non-bipartite $C_{2 k + 1}$ -free graphs

Rui Wang, Shipeng Wang

In strengthening a result of Andrásfai, Erdős and Sós in 1974, Häggkvist proved that if $G$ is an $n$ -vertex $C_{2 k + 1}$ -free graph with minimum degree $δ (G) > \frac{2 n}{2 k + 3}$ and $n…

math.CO2024

Extremal triangle-free graphs with chromatic number at least four

Sijie Ren, Jian Wang, Shipeng Wang +1

Let $G$ be an $n$ -vertex triangle-free graph. The celebrated Mantel's theorem showed that $e (G) \leq ⌊ \frac{n ^{2}}{4} ⌋$ . In 1962, Erdős (together with Gallai), and indepen…

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.CO2022

Counterexamples to Gerbner's Conjecture on Stability of Maximal $F$ -free Graphs

Jian Wang, Shipeng Wang, Weihua Yang

Let $F$ be an $(r + 1)$ -color critical graph with $r \geq 2$ , that is, $χ (F) = r + 1$ and there is an edge $e$ in $F$ such that $χ (F - e) = r$ . Gerbner recently conjectured that every $n$ -ver…

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$ …

The homomorphism threshold of odd cycle C2k−1​ is below 2k−11​

Longest odd cycles in non-bipartite C2k+1​-free graphs

Extremal triangle-free graphs with chromatic number at least four

A stability result for C2k+1​-free graphs

Counterexamples to Gerbner's Conjecture on Stability of Maximal F-free Graphs

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

The homomorphism threshold of odd cycle $C_{2 k - 1}$ is below $\frac{1}{2 k - 1}$

Longest odd cycles in non-bipartite $C_{2 k + 1}$ -free graphs

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

Counterexamples to Gerbner's Conjecture on Stability of Maximal $F$ -free Graphs

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