Content deleted Content added
Line 51:
== Triangles in Random Graphs ==
Given a random graph ''G(n,p<sub>n</sub>)''. If <math>p_{n}</math> ≪ <math>1/n</math>, then almost every ''G(n,p<sub>n</sub>)'' dose not contain a triangle. If <math>p_{n}</math> ≫ <math>1/n</math>, then almost every ''G(n,p<sub>n</sub>)'' contains a triangle.
We called ''r(n)=1/n'' the threshold function of the property that ''G(n,p<sub>n</sub>)'' contains a triangle.
===The proof===
| |||