Chromatic number of random graphs: an approach using a recurrence relation

The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic numbers, they tend to take an enormous amount of time for large graphs. In this paper, we propose a recurrence relation to rapidly obtain the expected value of the chromatic number of random graphs. Then we compare the results obtained using this recurrence relation with other methods using an exact investigation of all graphs, the Monte Carlo method, the iterated random color matching method, and the method presented in Bollobás’ previous studies.