# Markov's Inequality and Random graphs

Printable View

• April 7th 2010, 12:55 PM
qwesl
Markov's Inequality and Random graphs
Prove that the probability of the random graph $G_{5,\frac{1}{3}}$ containing a cycle of length $4$ is less than $\frac{3}{4}$
(using Markov's Inequality)