## random graphs

hi i need some help proving several theoremes in random graphs

1) let G~ be a random graph process, prove that WHP (with high probability) the first triangle apears before the graph is conected.

HINT: (writen in white)
find snapshot that WHP have triangle
find snapshot that WHP dont conected
show they different

10x