The two possible values of the chromatic number of a random graph

Dimitris Achlioptas, Assaf Naor. The two possible values of the chromatic number of a random graph. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 587-593, ACM, 2004. [doi]

@inproceedings{AchlioptasN04,
  title = {The two possible values of the chromatic number of a random graph},
  author = {Dimitris Achlioptas and Assaf Naor},
  year = {2004},
  doi = {10.1145/1007352.1007442},
  url = {http://doi.acm.org/10.1145/1007352.1007442},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/AchlioptasN04},
  cites = {0},
  citedby = {0},
  pages = {587-593},
  booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004},
  editor = {László Babai},
  publisher = {ACM},
  isbn = {1-58113-852-0},
}