Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The number of components of a random bipartite graph

From MaRDI portal
Publication:3970877
Jump to:navigation, search

DOI10.1515/DMA.1991.1.3.289zbMATH Open0746.05055OpenAlexW2033681355MaRDI QIDQ3970877

I. B. Kalugin

Publication date: 25 June 1992

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1991.1.3.289



zbMATH Keywords

asymptotic behaviourrandom graphrandom variablenumber of components


Mathematics Subject Classification ID

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



Related Items (1)

Random Generation and Enumeration of Bipartite Permutation Graphs






This page was built for publication: The number of components of a random bipartite graph

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3970877&oldid=11996903"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 00:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki