Two distinct triangles in a graph with at most one common vertex use disjoint edges, so their indicator random variables are independent and have zero covariance. A pair sharing an edge has covariance . The count from part (i) givesWith , the triangle variance in a binomial random graph therefore satisfiesBoth terms tend to zero when , because . Applying part (ii) provescompleting the triangle-existence threshold in a binomial random graph.
Articles by others on the same topic
There are currently no matching articles.