Cliques and Chromatic Number in Multiregime Random Graphs

In this paper, we study cliques and chromatic number in the random subgraph Gn of the complete graph Kn on n vertices, where each edge is independently open with a probability pn. Associating Gn with the probability measure ℙn, we say that the sequence {ℙn} is multiregime if the edge probability sequence {pn} is not convergent. Using a recursive method we obtain uniform bounds on the maximum clique size and chromatic number for such multiregime random graphs.