Let exq(G; n) be the maximum number of points in a rank-n geometry (simple matroid) that is representable over GF(q) and that has no restriction isomorphic to the geometry G. We fi...
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...