On the chromatic number of random graphs
- 1 December 1990
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 1 (4) , 435-442
- https://doi.org/10.1002/rsa.3240010404
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- The chromatic number of random graphs at the double-jump thresholdCombinatorica, 1989
- The chromatic number of random graphsCombinatorica, 1988
- Expose-and-merge exploration and the chromatic number of a random graphCombinatorica, 1987
- Sharp concentration of the chromatic number on random graphsG n, pCombinatorica, 1987
- Colouring random graphsAnnals of Operations Research, 1984
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963