Author： Krivelevich* Michael Sudakov† Benni Szabó‡ Tibor
Publisher： Springer Publishing Company
ISSN： 0209-9683
Source： Combinatorica, Vol.24, Iss.3, 2004-07, pp. : 403-426
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Dynamic choosability of triangle‐free graphs and sparse random graphs
JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,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. :
On-Line Coloring of Sparse Random Graphs and Random Trees
Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. :
Nonvertex‐Balanced Factors in Random Graphs
JOURNAL OF GRAPH THEORY, Vol. 78, Iss. 4, 2015-04 ,pp. :