| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653319 | European Journal of Combinatorics | 2016 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
James Oxley,