✦ LIBER ✦

Holes in random graphs

✍ Scribed by Tomasz Łuczak

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 376 KB
Volume: 30
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90045-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The size of the largest hole in a random

The size of the largest hole in a random graph

✍ Tomasz Łuczak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 775 KB

Let H(n, p) denote the size of the largest induced cycle in a random graph C(n, p). It is shown that if the expected average degree of G(n, p) is a constant larger than 1, then H(n, p) is of the order n with probability 1 -o(l). Moreover, for C(n, p) with large average degree, H(n, p) is determined

Random graphs

✍ A. Ruciński 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 60 KB

Detecting Holes and Antiholes in Graphs

✍ Stavros D. Nikolopoulos; Leonidas Palios 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 227 KB

Trees in random graphs

✍ P. Erdös; Z. Palka 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 183 KB

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)))

Kernels in random graphs

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

For each fixed p, the random directed graph D(n, p) on n vertices with (directed) edge probability p possesses a kernel with probability tending to 1 as n + a. Pour chaque p fixe, le graphe alCatoire D(n, p) a n sommets et probabilitts des arcs Cgales B p posstde un noyau avec une probabilit6 tenda