2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/24397Given any integer d >= 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k+1, or k+2, and that if (2k-1) \log k < d < 2k \log k then the chromatic number is either k+1 or k+2.Disordered Systems and Neural NetworksStatistical MechanicsCombinatoricsProbabilitytext