Disconnect giant component in random graphs by edge deletion

From a complete random graph (ER graph) after deleting an edge randomly with some probability (p) in each step how many edge deletion occurs to make the graph disconnected or break the giant component? What will be the value of p to make minimum no. of edge deletion?
Can we delay this phase transition by varying the value of p?