The Chromatic Number of Dense Random Block Graphs

The chromatic number $\chi(G)$ of a graph $G$, that is, the smallest number of colors required to color the vertices of $G$ so that no two adjacent vertices are assigned the same color, is a classic and extensively studied topic in computer science and mathematics. Here we consider the case where $G$ is a random block graph, also known as the stochastic block model. The vertex set is partitioned into $k\in\mathbb{N}$ parts $V_1, \dotsc, V_k$, and for each $1 \le i \le j \le k$, two vertices $u \in V_i, v\in V_j$ are connected by an edge with some probability $p_{i,j} \in (0,1)$ independently. Our main result pins down the typical asymptotic value of $\chi(G)$ and establishes the distribution of the sizes of the color classes in optimal colorings. In contrast to the case of a binomial random graph $G(n,p)$, that corresponds to $k=1$ in our model, where the size of an "average" color class in an (almost) optimal coloring essentially coincides with the independence number, the block model reveals a far more diverse and rich picture: there, in general, the "average" class in an optimal coloring is a convex combination of several "extreme" independent sets that vary in total size as well as in the size of their intersection with each $V_i$, $1\le i \le k$.