The Diameter of Random Graphs

DOI10.2307/1998567MaRDI QIDQ3936765zbMATHOpenAlexFDO

Authors Béla Bollobás

Publication date 1981

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1998567

zbMATH Keywords

diameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Enumeration in graph theory (05C30)

Cited in

(19)

• Edge and pair queries-random graphs and complexity
• The average distance and the diameter of dense random regular graphs
• On the threshold for rainbow connection number \(r\) in random graphs
• Network analysis of the Kyiv bylyny cycle -- East Slavic epic narratives
• Rainbow and monochromatic vertex-connection of random graphs
• Diameter in ultra-small scale-free random graphs
• Identifying codes and searching with balls in graphs
• On the local distinguishing numbers of cycles
• Rainbow \(k\)-connectivity of random bipartite graphs
• Distance-uniform graphs with large diameter
• Sieve methods in random graph theory
• Diameters of random circulant graphs
• Strong and weighted matchings in inhomogenous random graphs
• Rainbow connectivity and rainbow index of inhomogeneous random graphs
• On rainbow-\(k\)-connectivity of random graphs
• Algorithms and almost tight results for 3-colorability of small diameter graphs
• A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time
• Large random graphs in pseudo-metric spaces
• Geodesic cycles in random graphs

This page was built for publication: The Diameter of Random Graphs

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