Yuejian Peng

collaborators

2 papers

math.CO2025

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 $I^\pm$ such that any $\mathc…

math.CO2024

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

Yiran Zhang, Yuejian Peng

For graphs $G_{0}$ , $G_{1}$ and $G_{2}$ , write $G_{0} ⟼ (G_{1}, G_{2})$ if each red-blue-edge-coloring of $G_{0}$ yields a red $G_{1}$ or a blue $G_{2}$ . The Ramsey number $r (G_{1}, G_{2})$ is t…