The chromatic number of random graphs
- 1 March 1988
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 8 (1) , 49-55
- https://doi.org/10.1007/bf02122551
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- 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
- Random Graphs of Small OrderPublished by Elsevier ,1985
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spacesJournal of Algorithms, 1984
- On the chromatic forcing number of a random graphDiscrete Applied Mathematics, 1983
- Random embeddings of Euclidean spaces in sequence spacesIsrael Journal of Mathematics, 1981
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- On Tail Probabilities for MartingalesThe Annals of Probability, 1975
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967