✦ LIBER ✦

Maximal Paths in Random Dynamic Graphs

✍ Scribed by Loulou, Richard

Book ID: 122229142
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 559 KB
Volume: 8
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(87)80036-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long paths in sparse random graphs

✍ Béla Bollobás 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 207 KB

Small maximal matchings in random graphs

✍ Michele Zito 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 204 KB

We look at the minimal size of a maximal matching in general, bipartite and d-regular random graphs. We prove that with high probability the ratio between the sizes of any two maximal matchings approaches one in dense random graphs and random bipartite graphs. Weaker bounds hold for sparse random gr

Random maximal H-free graphs

✍ Deryk Osthus; Anusch Taraz 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 2 views

Given a graph H, a random maximal H-free graph is constructed by the following random greedy process. First assign to each edge of the complete graph on n vertices a birthtime which is uniformly distributed in [0, 1]. At time p = 0 start with the empty graph and increase p gradually. Each time a new

On maximal paths and circuits of graphs

✍ P. Erdős; T. Gallai 📂 Article 📅 1959 🏛 Akadmiai Kiad 🌐 English ⚖ 975 KB

Shortest paths on dynamic graphs

✍ Giacomo Nannicini; Leo Liberti 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

Maximal induced trees in sparse random g

Maximal induced trees in sparse random graphs

✍ Tomasz łuczak; Zbigniew Palka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 493 KB

A study of the orders of maximal induced trees in a random graph G, with small edge probability p is given. In particular, it is shown that the giant component of almost every G,, where p = c/n and c > 1 is a constant, contains only very small maximal trees (that are of a specific type) and very lar