Random graph: Difference between revisions

Revision as of 07:28, 12 January 2015

Revision as of 07:40, 12 January 2015

Line 53:

===The proof===

Let ''X(G)'' be the number of triangles in ''G''. Let the set <math>{T_{1}, {T_{2}}, ..., {T_{{n \choose 3}}}}</math> be all of thepossible triangles in aG fixedand graphlet of<math>X_{i}(G)</math> orderbe ''n''a andrandom letvariable the randomsuch that variable <math>X_{i}(G)</math> be =1 if ''G'' contains the triangle <math>T_{i}</math>, or be<math>X_{i}(G)</math>=1 zerootherwise.

Note that