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
Showing 2024Show all

1 paper · 1 filter

math.CO2024

Chromatic profiles of odd cycles

Zilong Yan, Yuejian Peng, Xiaoli Yuan

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