Estimation of the number of maximal extensions in a random graph (Q4917387)
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 6159362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimation of the number of maximal extensions in a random graph |
scientific article; zbMATH DE number 6159362 |
Statements
Estimation of the number of maximal extensions in a random graph (English)
0 references
29 April 2013
0 references
neutral pairs
0 references
maximal pairs
0 references
complete graphs
0 references
residual graphs
0 references
number of safe extensions of subgraphs in a random graph
0 references
0.8092029094696045
0 references
0.8044832348823547
0 references
0.7853334546089172
0 references
0.770102858543396
0 references
