CLIQUES, CHROMATIC NUMBER, AND INDEPENDENT SETS IN THE SEMI-RANDOM PROCESS.

The semi-random graph process is a single player game in which the player is initially presented an empty graph on n vertices. In each round, a vertex u is presented to the player independently and uniformly at random. The player then adaptively selects a vertex v and adds the edge uv to the graph. For a fixed monotone graph property, the objective of the player is to force the graph to satisfy this property with high probability in as few rounds as possible. In this paper, we investigate the following three properties: containing a complete graph of order k, having the chromatic number at least k, and not having an independent set of size at least k. [ABSTRACT FROM AUTHOR]