Skip to main content
Springer Nature Link
Log in

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

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

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

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

  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

Authors and Affiliations

  1. Department of Discrete Mathematics, Adam Mickrewicz University, Poznań, Poland

    Tomasz Luczak

Authors
  1. Tomasz Luczak
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01205080

AMS subject classification (1980)

Search

Navigation