Fractional DP-chromatic number of planar graphs of large girth

This paper proves that for any integer k ≥ 1, every planar graph G of girth at least 8k − 3 has fractional DP-chromatic number at most 2 + 1 k.