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_