Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let be the minimal such that if the edges of are coloured with colours then there must be a monochromatic odd cycle of length at most . Estimate .
Source: erdosproblems.com/609
No claim settles this problem.
Open (the site's label, which adds that the problem cannot be resolved by a finite computation). The sources below give separated lower and upper bounds at the exact host threshold , but they do not determine the growth order; the search recorded under Current assessment found nothing further, and that negative result is not proof of openness. Two refereed bounds are accepted partial claims: Day and Johnson's lower bound, which answers Chung's question whether , and Janzer and Yip's upper bound. Two partial claims are pending: Girão and Hunter's earlier upper bound, a preprint, and the value , recorded on its claim page (Cai, 2026).