✦ LIBER ✦

On the strength of connectedness of a random graph

✍ Scribed by P. Erdős; A. Rényi

Publisher: Akadmiai Kiad
Year: 1964
Tongue: English
Weight: 233 KB
Volume: 12
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf02066689

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the connectedness of optimum-degenera

On the connectedness of optimum-degeneracy graphs

✍ Peter Zörnig; Tomas Gal 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Behavior of the connectedness of a rando

Behavior of the connectedness of a randomGn, 1/2graph

✍ A. S. Ambrosimov 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 184 KB

On the chromatic forcing number of a ran

On the chromatic forcing number of a random graph

✍ Colin McDiarmid 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 549 KB

The strongest monotone degree condition

The strongest monotone degree condition for n-connectedness of a graph

✍ F.T Boesch 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 170 KB

On the number of induced subgraphs of a

On the number of induced subgraphs of a random graph

✍ Hiroshi Maehara 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On the average genus of the random graph

✍ Saul Stahl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ