On the independence and chromatic numbers of random regular graphs
- 1 January 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 54 (1) , 123-132
- https://doi.org/10.1016/0095-8956(92)90070-e
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- The chromatic number of random graphsCombinatorica, 1991
- On the independence number of random graphsDiscrete Mathematics, 1990
- The chromatic number of random graphsCombinatorica, 1988
- Sharp concentration of the chromatic number on random graphsG n, pCombinatorica, 1987
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967