DM
2000
13 years 4 months ago
2000
In this paper, we
DM
2000
13 years 4 months ago
2000
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...
DM
2000
13 years 4 months ago
2000
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...
DM
2000
13 years 4 months ago
2000
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
DM
2000
13 years 4 months ago
2000
DM
2000
13 years 4 months ago
2000
DM
2000
13 years 4 months ago
2000
DM
2000
13 years 4 months ago
2000
DM
2000
13 years 4 months ago
2000
For every integer j
DM
2000
13 years 4 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.