Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum

zbMath0793.05111MaRDI QIDQ1320669

V. P. Polesskij

Publication date: 18 May 1994

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

connectednesslower boundtreesrandom graphcycle matroidbase spectrum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

This page was built for publication: Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum