Conjectured circular-flow bound for odd-regular graphs

Let $t>1$ be an integer and let $G$ be a $(2t+1)$-graph, meaning a graph in which every vertex has degree $2t+1$. The odd-regular flow conjecture. Every such graph satisfies

$$F_c(G)\leq 2+\frac{2}{t}.$$

The source presents this as a possible extension of the statement equivalent to Tutte's 3-flow conjecture for $5$-graphs; it would imply the accompanying conjecture for class 1 graphs and remains open in the stated range.