Publisher： Academic Press
ISSN： 0196-8858
Source： Advances in Applied Mathematics, Vol.26, Iss.4, 2001-05, pp. : 257-279
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
On the max‐cut of sparse random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. :
Access to resources
Recommend
Triangle Factors In Sparse Pseudo-Random Graphs
By Krivelevich* Michael Sudakov† Benni Szabó‡ Tibor
Combinatorica, Vol. 24, Iss. 3, 2004-07 ,pp. :
Dynamic choosability of triangle‐free graphs and sparse random graphs
JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. :
On-Line Coloring of Sparse Random Graphs and Random Trees
Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. :