Local connectivity of a random graph

DOI10.1002/JGT.3190070405MaRDI QIDQ3310660zbMATH OpenOpenAlexFDO

Authors Edgar M. Palmer, R. W. Robinson, P. Erdős

Publication date 1983

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190070405

zbMATH Keywords

induced subgraphthreshold functionlocal connectivityneighbourhood connected

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 15665
• On the connectedness of a random graph
• On the strength of connectedness of a random graph
• Bounds on probability of group connectedness of a random graph
• Random Subgraphs in Sparse Graphs

Cited in

(9)

• On graphs whose eternal vertex cover number and vertex cover number coincide
• scientific article; zbMATH DE number 637324 (Why is no real title available?)
• On connectivity in random graph models with limited dependencies
• Local connectivity of neutral networks
• Hamiltonicity of locally Hamiltonian and locally traceable graphs
• The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs
• Threshold functions for local properties of graphs: Triangles
• Local resilience of an almost spanning k‐cycle in random graphs
• Partitioning random graphs into monochromatic components

This page was built for publication: Local connectivity of a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3310660)