A generalization of an inequality of Stepanov

DOI10.1016/0095-8956(90)90122-GzbMath0721.05053OpenAlexW2000406844MaRDI QIDQ2640621

Lajos Takács

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90122-g

zbMATH Keywords

connectednessreachabilityrandom graphBernoulli graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cites Work

• The expected linearity of a simple equivalence algorithm
• Some Recurrence Formulas for Probability of Correctedness of Random Graphs
• Random Graphs
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• Combinatorial Algebra and Random Graphs
• Unnamed Item

This page was built for publication: A generalization of an inequality of Stepanov