A note on the sharp concentration of the chromatic number of random graphs

This is a preview of subscription content, access via your institution.

References

  1. [1]

    B. Bollobás: “Graph Theory—An Introductory Course”, Springer-Verlag, 1979.

  2. [2]

    T. Luczak: The size and connectivity of thek-core of a random graphDiscrete Math, to appear.

  3. [3]

    E. Shamir, andJ. Spencer: Sharp concentration of the chromatic number on random graphsG n,p Combinatorica 7 (1987), 124–129.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Luczak, T. A note on the sharp concentration of the chromatic number of random graphs. Combinatorica 11, 295–297 (1991). https://doi.org/10.1007/BF01205080

Download citation

AMS subject classification (1980)

  • 05 C 80