On the connected components of a random permutation graph with a given number of edges
Under an Elsevier user license
open archive
Keywords
Random permutation
Permutation graph
Connectivity threshold
Indecomposable permutation
Inversion
Cited by (0)
- 1
Supported in part by NSF Grant DMS-1101237.
Copyright © 2013 Elsevier Inc. All rights reserved.