A matroid analogue of a theorem of Brooks for graphs

Brooks proved that the chromatic number of a loopless connected graph GG is at most the maximum degree of GG unless GG is an odd cycle or a clique. This note proves an analogue of this theorem for GF(p)GF(p)-representable matroids when pp is prime, thereby verifying a natural generalization of a conjecture of Peter Nelson.