On the domination number of a random graph (Q5950386)

A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). The minimum number of vertices of a dominating set in \(G\) is the domination number \(D(G)\) of \(G\). The symbol \(G(n,p)\) denotes the random graph with \(n\) vertices in which the existence probability of each potential edge equals \(p\). The paper contains an assertion on the probability of a certain inequality for the domination number of \(G(n,p)\) and of a certain sequence of random graphs, an assertion on the expected number of dominating sets with \(r\) vertices in \(G(n,p)\) and an assertion on a value of \(D(G)\) having the probability approaching unity; everything is for finite random graphs. But at the end, one assertion concerning infinite random graphs is added.