On the Number of Solutions in Random Graphk-Colouring
2018 ◽
Vol 28
(1)
◽
pp. 130-158
◽
Keyword(s):
Letk⩾ 3 be a fixed integer. We exactly determine the asymptotic distribution of lnZk(G(n, m)), whereZk(G(n, m)) is the number ofk-colourings of the random graphG(n, m). A crucial observation to this end is that the fluctuations in the number of colourings can be attributed to the fluctuations in the number of small cycles inG(n, m). Our result holds for a wide range of average degrees, and forkexceeding a certain constantk0it covers all average degrees up to the so-calledcondensation phase transition.
2016 ◽
Vol 26
(3)
◽
pp. 338-366
◽
Keyword(s):
2010 ◽
Vol 19
(5-6)
◽
pp. 835-926
◽
Keyword(s):
2016 ◽
Vol 4
(43)
◽
pp. 10279-10285
◽
Keyword(s):
Keyword(s):
1967 ◽
Vol 10
(4)
◽
pp. 579-583
◽