On the connected components of a random permutation graph with a given number of edges (Q388720)
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 6243003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the connected components of a random permutation graph with a given number of edges |
scientific article; zbMATH DE number 6243003 |
Statements
On the connected components of a random permutation graph with a given number of edges (English)
0 references
6 January 2014
0 references
random permutation
0 references
permutation graph
0 references
connectivity threshold
0 references
indecomposable permutation
0 references
inversion
0 references
0 references
0.7574552893638611
0 references
0.7553269863128662
0 references
0.747561514377594
0 references
0.7465294003486633
0 references
0.7459133863449097
0 references
