Fractional DP-colorings of $d$-degenerate locally sparse graphs

Abstract: Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $$χ<em>f^{{\mathrm{DP}}} \le (1 + o(1))\frac{d}{\log d}$$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $$χ_f^{{\mathrm{DP}}} \le (4 + o(1))\frac{d}{\log d}$$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d<sup>2}{f}$-locally-sparse, then [ χ_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. ] This immediately yields an identical upper bound on the ordinary fractional chromatic number $χ_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d<sup>2$, we construct $d$-degenerate graphs that are left $\frac{d<sup>2}{f}$-locally-sparse and satisfy $χ_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K</em>{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $Δ$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.