✦ LIBER ✦

Size and connectivity of the k-core of a random graph

✍ Scribed by Tomasz Łuczak

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 467 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90162-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-leaf connectivity of a random graph

✍ Thomasz Luczak 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (

Local connectivity of a random graph

✍ P. Erdös; E. M. Palmer; R. W. Robinson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract A graph is locally connected if for each vertex ν of degree __≧2__, the subgraph induced by the vertices adjacent to ν is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_

On k-connectivity for a geometric random

On k-connectivity for a geometric random graph

✍ Mathew D. Penrose 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

For n points uniformly randomly distributed on the unit cube in d dimensions, ## Ž . with dG 2, let respectively, denote the minimum r at which the graph, obtained by n n adding an edge between each pair of points distant at most r apart, is k-connected Ž . w x respectively, has minimum degree k

Data analysis and the connectivity of ra

Data analysis and the connectivity of random graphs

✍ James V. Schultz; Lawrence J. Hubert 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Traversability and connectivity of the m

Traversability and connectivity of the middle graph of a graph

✍ Takashi Hamada; Izumi Yoshimura 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 871 KB

Quantum Simulations of Classical Random

Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity

✍ John Watrous 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 160 KB

While it is straightforward to simulate a very general class of random processes space-efficiently by non-unitary quantum computations (e.g., quantum computations that allow intermediate measurements to occur), it is not currently known to what extent restricting quantum computations to be unitary a