Prove that the probability of the random graph $\displaystyle G_{5,\frac{1}{3}}$ containing a cycle of length $\displaystyle 4 $ is less than $\displaystyle \frac{3}{4}$

(using Markov's Inequality)

Printable View

- Apr 7th 2010, 12:55 PMqweslMarkov's Inequality and Random graphs
Prove that the probability of the random graph $\displaystyle G_{5,\frac{1}{3}}$ containing a cycle of length $\displaystyle 4 $ is less than $\displaystyle \frac{3}{4}$

(using Markov's Inequality)