The Diameter of Random Graphs
From MaRDI portal
Publication:3936765
DOI10.2307/1998567zbMath0479.05038OpenAlexW4242518419MaRDI QIDQ3936765
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
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Combinatorial probability (60C05)
Related Items (18)
Rainbow connectivity and rainbow index of inhomogeneous random graphs ⋮ Edge and pair queries-random graphs and complexity ⋮ The average distance and the diameter of dense random regular graphs ⋮ On rainbow-\(k\)-connectivity of random graphs ⋮ Geodesic cycles in random graphs ⋮ Sieve methods in random graph theory ⋮ Diameters of random circulant graphs ⋮ Diameter in ultra‐small scale‐free random graphs ⋮ Rainbow \(k\)-connectivity of random bipartite graphs ⋮ A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time ⋮ On the threshold for rainbow connection number \(r\) in random graphs ⋮ Large random graphs in pseudo-metric spaces ⋮ Strong and weighted matchings in inhomogenous random graphs ⋮ Distance-Uniform Graphs with Large Diameter ⋮ On the local distinguishing numbers of cycles ⋮ Rainbow and monochromatic vertex-connection of random graphs ⋮ Identifying codes and searching with balls in graphs ⋮ Algorithms and almost tight results for 3-colorability of small diameter graphs
This page was built for publication: The Diameter of Random Graphs
