✦ LIBER ✦

Theory of random graphs

✍ Scribed by I. N. Kovalenko

Publisher: Springer US
Year: 1974
Tongue: English
Weight: 214 KB
Volume: 7
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic theory of random graphs

✍ Alan Frieze; Colin McDiarmid 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB 👁 2 views

The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariantsᎏsee Bollobas 21 . There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this pap

Random graphs in the monadic theory of o

Random graphs in the monadic theory of order

✍ Shmuel Lifsches; Saharon Shelah 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 278 KB

Random Graph Coverings I: General Theory

Random Graph Coverings I: General Theory and Graph Connectivity

✍ Alon Amit; Nathan Linial 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 254 KB

Random graphs

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

A problem of the theory of graphs, conne

A problem of the theory of graphs, connected with random fields

✍ M.D. Shklover 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 359 KB

Random trees and random graphs

✍ Tomasz Łuczak 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB 👁 2 views

In the paper we study the asymptotic behavior of the number of trees with n Ž . Ž . vertices and diameter k s k n , where n y k rnª a as n ª ϱ for some constant a-1. We use this result to determine the limit distribution of the diameter of the random graph Ž .