Harris's fractional chromatic number conjecture for triangle-free degenerate graphs

Let $G$ be a graph, and let $d$ be a nonnegative integer such that $G$ is $d$-degenerate, meaning that every subgraph of $G$ has a vertex of degree at most $d$. Let $\triangle$-free mean containing no copy of the triangle, and let $\chi_f(G)$ denote the fractional chromatic number of $G$. Harris's conjecture. If $G$ is $d$-degenerate and triangle-free, then

$$\chi_f(G)=O\left(\frac{d}{\log d}\right).$$

The conjecture predicts a logarithmic improvement over the general degeneracy bound for fractional chromatic number; the paper presents results toward it and later states that it has been resolved, so the conjecture itself is no longer open.