Question in exam paper. Given an undirected G(n, p) graph with p=1.2/n , what is the expected size of its giant component?
Note: I know that there is a giant component because np = 1.2 > 1 and that the other small components are of size O(log n). I think however that this questions wants a real number like 1.2n or something. What is that number and how do you find it?