Proved: the site labels the problem PROVED and credits Thomassen [Th83], whose theorem gives, in any graph of uncountable chromatic number, an edge lying on a cycle of every sufficiently large length. The site attributes the question to Erdős, Hajnal and Shelah [EHS74], who proved that such a graph contains odd cycles of every sufficiently large length, Problem 594.