A generalization of an inequality of Stepanov (Q2640621)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of an inequality of Stepanov |
scientific article |
Statements
A generalization of an inequality of Stepanov (English)
0 references
1990
0 references
In a Bernoulli graph with n nodes and edge probability p an upper bound is derived for the probability that k nodes can be reached from a fixed set of nodes.
0 references
random graph
0 references
connectedness
0 references
reachability
0 references
Bernoulli graph
0 references
