✦ LIBER ✦

Large holes in sparse random graphs

✍ Scribed by A. M. Frieze; B. Jackson

Book ID: 110564350
Publisher: Springer-Verlag
Year: 1987
Tongue: English
Weight: 353 KB
Volume: 7
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large induced trees in sparse random gra

Large induced trees in sparse random graphs

✍ A.M Frieze; B Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 621 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

Some large deviation results for sparse

Some large deviation results for sparse random graphs

✍ Neil O'Connell 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 189 KB

Holes in random graphs

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

Trees in sparse random graphs

✍ W.Fernandez de la Vega 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Cycles in sparse random graphs

✍ Marinari, E; Kerrebroeck, V V 📂 Article 📅 2008 🏛 Institute of Physics 🌐 English ⚖ 442 KB