Abstract
For a fixed probabilityp, 0<p<1, almost every random graphG n,p has chromatic number
,
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Azuma, Weighted sums of certain dependent random variables,Tôhoku Math. J.,3 (1967), 357–367.
B. Bollobás, The evolution of sparse graphs,in Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honour of Paul Erdős (B. Bollobás, ed.), Academic Press, London, 1984, 35–37.
B. Bollobás,Random Graphs, Academic Press, London, 1985, xvi+447 pp.
B. Bollobás andP. Erdős, Cliques in random graphs,Math. Proc. Cambridge Phil. Soc.,80 (1976), 419–427.
B.Bollobás and A. G.Thomason, Random graphs of small order,in Random Graphs, Annals of Discr. Math., 1985, 47–97.
P. Erdős andJ. Spencer,Probabilistic Methods in Combinatorics, Academic Press, New York and London, 1974.
D. Freedman, On tail probabilities for martingales,Ann. Probab.,3 (1975), 100–118.
G. R. Grimmett andC. J. H. McDiarmid, On colouring random graphs,Math. Proc. Cambridge Phil. Soc.,77 (1975), 313–324.
W. B. Johnson andG. Schechtman, Embeddingl mp intol n1 ,Acta Math.,150 (1983), 71–85.
C. J. H.McDiarmid, Colouring random graphs badly,in Graph Theory and Combinatorics (R. J. Wilson, ed.), Pitman Research Notes in Mathematics,34 (1979), 76–86.
C. J. H. McDiarmid, On the chromatic forcing number of a random graph,Discrete Appl. Math.,5 (1983), 123–132.
D. W. Matula, Expose-and-merge exploration and the chromatic number of a random graph,Combinatorica,7 (1987), 275–284.
B. Maurey, Construction de suites symétriques,Compt. Rend. Acad. Sci. Paris 288 (1979), 679–681.
V. D.Milman and G.Schechtman,Asymptotic Theory of Finite Dimensional Normed Spaces, Lecture Notes in Mathematics, vol. 1200, Springer-Verlag, 1986, viii+156 pp.
G. Pisier, On the dimension ofl np -subspaces of Banach spaces, for 1<p<2,Trans. Amer. Math. Soc.,276 (1983), 201–211.
E. Shamir andJ. Spencer, Sharp concentration of the chromatic number of random graphsG n,p,Combinatorica,7 (1987), 121–129.
G. Schechtman, Random embeddings of euclidean spaces in sequence spaces,Israel J. Math.,40 (1981), 187–192.
E. Shamir andR. Upfal, Sequential and distributed graph colouring algorithms with performance analysis in random graph spaces,J. of Algorithms 5 (1984), 488–501.
W. F. De La Vega, On the chromatic number of sparse random graphs,in Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honour of Paul Erdős (B. Bollobás, ed., Academic Press, London, 1984, 321–328.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bollobás, B. The chromatic number of random graphs. Combinatorica 8, 49–55 (1988). https://doi.org/10.1007/BF02122551
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02122551