✦ LIBER ✦

Cycles in sparse random graphs

✍ Scribed by Marinari, E; Kerrebroeck, V V

Book ID: 120936201
Publisher: Institute of Physics
Year: 2008
Tongue: English
Weight: 442 KB
Volume: 95
Category: Article
ISSN: 1742-6588
DOI: 10.1088/1742-6596/95/1/012014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding hamilton cycles in sparse random

Finding hamilton cycles in sparse random graphs

✍ A.M Frieze 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 911 KB

On large matchings and cycles in sparse

On large matchings and cycles in sparse random graphs

✍ A.M Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Let k be a fixed positive integer. A graph H has property Mk if it contains [½k] edge disjoint hamilton cycles plus a further edge disjoint matching which leaves at most one vertex isolated, if k is odd. Let p = c/n, where c is a large enough constant. We show that G,,p a.s. contains a vertex induce

Optimal Packings of Hamilton Cycles in S

Optimal Packings of Hamilton Cycles in Sparse Random Graphs

✍ Krivelevich, Michael; Samotij, Wojciech 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 279 KB

On the Number of Hamilton Cycles in Spar

On the Number of Hamilton Cycles in Sparse Random Graphs

✍ Glebov, Roman; Krivelevich, Michael 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 240 KB

Edge disjoint Hamilton cycles in sparse

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

✍ Bollob�s, B.; Cooper, C.; Fenner, T. I.; Frieze, A. M. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 3 views

Let G n,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property A k , if G contains (k -1)/2 edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size n/2 . We prove that, for

Cycles in random graphs

✍ Tomasz Łuczak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 348 KB

tuczak, T., Cycles in random graphs, Discrete Mathematics 98 (1991) 231-236. Let G(n, p) be a graph on n vertices in which each possible edge is presented independently with probability p = p(n) and u'(n, p) denote the number of vertices of degree 1 in G(n, p). It is shown that if E > 0 and rip(n)))