Upper bounds on the non-3-colourability threshold of random graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2002

Upper bounds on the non-3-colourability threshold of random graphs

Abstract

We present a full analysis of the expected number of 'rigid' 3-colourings of a sparse random graph. This shows that, if the average degree is at least 4.99, then as n → ∞ the expected number of such colourings tends to 0 and so the probability that the graph is 3-colourable tends to 0. (This result is tight, in that with average degree 4.989 the expected number tends to ∞.) This bound appears independently in Kaporis \textitet al. [Kap]. We then give a minor improvement, showing that the probability that the graph is 3-colourable tends to 0 if the average degree is at least 4.989.
Fichier principal
Vignette du fichier
dm050114.pdf (178.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958983 , version 1 (13-03-2014)

Identifiers

Cite

Nikolaos Fountoulakis, Colin Mcdiarmid. Upper bounds on the non-3-colourability threshold of random graphs. Discrete Mathematics and Theoretical Computer Science, 2002, Vol. 5, pp.205-226. ⟨10.46298/dmtcs.299⟩. ⟨hal-00958983⟩

Collections

TDS-MACS
475 View
706 Download

Altmetric

Share

Gmail Facebook X LinkedIn More