Bound degrees of sparse random graphs

246 Views Asked by At

I might be wrong but I think this problem (Exercise 2.4.2) means $d=o(\log n)$? If so, can anyone give a hint instead of telling the answer.

enter image description here enter image description here