✦ LIBER ✦

Limit distributions of the number of cycles of given length in a random permutation with given number of cycles

✍ Scribed by Cherepanova, E. V.

Book ID: 120137496
Publisher: Walter de Gruyter GmbH & Co. KG
Year: 2003
Tongue: English
Weight: 120 KB
Volume: 13
Category: Article
ISSN: 0924-9265
DOI: 10.1163/156939203322694772

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Emergence of a giant component in a rand

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

✍ Kazimirov, N. I. 📂 Article 📅 2003 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 113 KB

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.

Limit Theorem for the General Number of

Limit Theorem for the General Number of Cycles in a Random A -Permutation

✍ Yakymiv, A. L. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 184 KB

List coloring of graphs having cycles of

List coloring of graphs having cycles of length divisible by a given number

✍ S. Akbari; M. Ghanbari; S. Jahanbekam; M. Jamaali 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 237 KB

On asymptotic expansions for the distrib

On asymptotic expansions for the distributions of the number of cycles in a random permutation

✍ Timashov, A. N. 📂 Article 📅 2003 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 107 KB

The number of cycle lengths in graphs of

The number of cycle lengths in graphs of given minimum degree and girth

✍ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.