= Sterbenz lemma
{wiki=Sterbenz_lemma}
The Sterbenz lemma is a result in graph theory, particularly in the area of random graphs and percolation theory. It provides conditions under which a large connected component will exist in a random graph or a random structure. More specifically, the lemma is often discussed in the context of random graphs model \\( G(n, p) \\), where \\( n \\) is the number of vertices and \\( p \\) is the probability of an edge existing between any two vertices.
Back to article page
