𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Emergence of a giant component in a random permutation with given number of cycles

✍ Scribed by Kazimirov, N. I.

Book ID
120137497
Publisher
Walter de Gruyter GmbH & Co. KG
Year
2003
Tongue
English
Weight
113 KB
Volume
13
Category
Article
ISSN
0924-9265

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a random graph with immigrating verti
On a random graph with immigrating vertices: Emergence of the giant component
✍ David J. Aldous; Boris Pittel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 186 KB πŸ‘ 2 views

A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1/n, is studied. The detailed picture of emergence of giant components with O n 2/3 vertices is shown to be the same as in the ErdΕ‘s-RΓ©nyi graph process with the number of vertices fixed at n at t

Nonseparable graphs with a given number
Nonseparable graphs with a given number of cycles
✍ Ranko Ε Δ‡epanoviΔ‡; Gerhard Ringel; Dragan MaruΕ‘ič; G. L. Chia; Brian Alspach πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 646 KB

## Abstract G. Ringel conjectured that for every positive integer __n__ other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with __n__ cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.