Graphs with bounded tree-width and large odd-girth are almost bipartite

We prove that for every k and every ε > 0 , there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε .