Dense subgraphs in random graphs (Q1741497)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7050989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense subgraphs in random graphs |
scientific article; zbMATH DE number 7050989 |
Statements
Dense subgraphs in random graphs (English)
0 references
3 May 2019
0 references
cliques
0 references
random graphs
0 references
probabilistic combinatorics
0 references
dense clusters
0 references
networks in sociometry
0 references
Erdős-Renyi random graph
0 references
binomial random graph
0 references
0.845513641834259
0 references
0.8202254176139832
0 references
0.812685489654541
0 references
0.8036282658576965
0 references
0.795768678188324
0 references
