User3419
Reputation
Top tag
Next privilege 250 Rep.
 Oct 29 awarded Popular Question Apr 19 awarded Notable Question Oct 18 awarded Commentator Oct 18 comment Threshold of connectivity in a random graph So how do you arrive at $(1-p) \leqslant \mathrm{e}^{-p}$? Or is it another inequality? Oct 18 comment Threshold of connectivity in a random graph Thanks very much for your reply once again! For the second equation I understand how it works (which confirmed my understanding) but still I do not see the connection between the first one, the line that concludes the formal proof, and the inequalities I've provided that should facilitate arriving at the proof. Could you, please, elaborate on it? Oct 15 revised Threshold of connectivity in a random graph deleted 1 characters in body Oct 15 comment Threshold of connectivity in a random graph Well, as I stated in the post, I cannot arrive at the last line of the proof. I've reported my derivations which lead me nowhere w.r.t. the proof, so the question is basically, how given the two inequalities (before my own intervention after the $\therefore$ symbol) the line of the proof can be obtained? Oct 15 asked Threshold of connectivity in a random graph Apr 2 awarded Popular Question Feb 13 revised Combination of splitting elements into pairs deleted 8 characters in body Apr 30 comment Combination of splitting elements into pairs @user6312, thank you! Apr 29 comment Combination of splitting elements into pairs I see. Thanks very much! Apr 29 accepted Combination of splitting elements into pairs Apr 28 asked Combination of splitting elements into pairs Apr 28 comment Problem about number of vertices of a graph @Jim Conant and @lhf: Thank you! Apr 28 comment Problem about number of vertices of a graph Thanks very much for the explanation! Apr 28 awarded Supporter Apr 28 revised Problem about number of vertices of a graph added 48 characters in body; added 12 characters in body Apr 28 accepted Problem about number of vertices of a graph Apr 28 asked Problem about number of vertices of a graph