Behavior of the connectedness of a random G(n,1/2) graph

DOI10.1007/BF01140138zbMATH Open0477.05059OpenAlexW2041273357MaRDI QIDQ1160147FDOQ1160147

Authors: A. S. Ambrosimov 

Publication date: 1981

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01140138

zbMATH Keywords

random graph

Mathematics Subject Classification ID

Combinatorial probability (60C05) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)

This page was built for publication: Behavior of the connectedness of a random G(n,1/2) graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160147)