1
$\begingroup$

$G(n,p)$ - binomial random graph on $n$ vertexes and with constant probability $p$ of edges. In general, is there formula for calculating probability that graph has no triangles. I'm not intered at asymptotic equality of this probability, for this purpose more articles in web.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.