Fractional colorings of cubic graphs with large girth

Frantisek Kardos, Daniel Kral, Jan Volec

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size…