Cliques and Chromatic Number in Multiregime Random Graphs

In this paper, we study cliques and chromatic number in the random subgraphG(n)of the complete graphK(n)onnvertices, where each edge is independently open with a probabilityp(n). AssociatingG(n)with the probability measure P-n, we say that the sequence {P-n} ismultiregimeif the edge probability sequence {p(n)} is not convergent. Using a recursive method we obtain uniform bounds on the maximum clique size and chromatic number for such multiregime random graphs.