Xiaoli Yuan

activity

20202024

most citedTight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite

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

collaborators

3 papers

math.CO2024

Chromatic profiles of odd cycles

Zilong Yan, Yuejian Peng, Xiaoli Yuan

Erdős and Simonovits asked the following question: For an integer $c \geq 2$ and a family of non-bipartite graphs $F$ , what is the infimum of $α$ such that any $\mathcal{F…

math.CO2023★ 4 cited

Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite

Xiaoli Yuan, Yuejian Peng

Erdős and Simonovits asked the following question: For an integer $r \geq 2$ and a family of non-bipartite graphs $H$ , determine the infimum of $α$ such that any $\mathcal…

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

Chromatic profiles of odd cycles

Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite

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

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