Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.