Name
Abstract | ||
|---|---|---|
Brooks proved that the chromatic number of a loopless connected graph G is at most the maximum degree of G unless G is an odd cycle or a clique. This note proves an analogue of this theorem for G F ( p ) -representable matroids when p is prime, thereby verifying a natural generalization of a conjecture of Peter Nelson. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ejc.2015.10.011 | European Journal of Combinatorics |
Field | DocType | Volume |
Prime (order theory),Matroid,Discrete mathematics,Combinatorics,Clique,Brooks' theorem,Degree (graph theory),Graphic matroid,Connectivity,Conjecture,Mathematics | Journal | 53 |
Issue | ISSN | Citations |
C | 0195-6698 | 0 |
PageRank | References | Authors |
0.34 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Oxley | 1 | 397 | 57.57 |