Partitioning random graphs into large cycles (Q1104340)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning random graphs into large cycles |
scientific article; zbMATH DE number 4055666
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning random graphs into large cycles |
scientific article; zbMATH DE number 4055666 |
Statements
Partitioning random graphs into large cycles (English)
0 references
1988
0 references
Let G be a graph chosen randomly from the set of graphs with \(m=m(n)\) edges on n vertices. For any fixed integer r, the probability that G can be partitioned equitably into r cycles is given for \(n\to \infty\).
0 references
random graph
0 references
Hamilton cycle
0 references
limiting probability distribution
0 references
0 references
