Author： Pittel B. Weishaar R.S.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.23, Iss.1, 1997-04, pp. : 195-205
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Coloring random graphs online without creating monochromatic subgraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 44, Iss. 4, 2014-07 ,pp. :
Access to resources
Recommend
The Diameter of Sparse Random Graphs
Advances in Applied Mathematics, Vol. 26, Iss. 4, 2001-05 ,pp. :
On the max‐cut of sparse random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. :
Coloring graphs from random lists of fixed size
RANDOM STRUCTURES AND ALGORITHMS, Vol. 44, Iss. 3, 2014-05 ,pp. :
Triangle Factors In Sparse Pseudo-Random Graphs
By Krivelevich* Michael Sudakov† Benni Szabó‡ Tibor
Combinatorica, Vol. 24, Iss. 3, 2004-07 ,pp. :