scientific article; zbMATH DE number 1380601

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4<485::AID-RSA16>3.0.CO;2-Y" /><485::AID-RSA16>3.0.CO;2-Y 10.1002/(SICI)1098-2418(199810/12)13:3/4<485::AID-RSA16>3.0.CO;2-YzbMath0959.05111MaRDI QIDQ4705337

Tomasz Łuczak

Publication date: 19 December 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asymptotic behaviordiametertreesrandom graph

Mathematics Subject Classification ID

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

Related Items (17)

Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ Resistance distance distribution in large sparse random graphs ⋮ The continuum limit of critical random graphs ⋮ The average distance and the diameter of dense random regular graphs ⋮ Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? ⋮ Mixing time of near-critical random graphs ⋮ Noise sensitivity of critical random graphs ⋮ On the tree-depth of random graphs ⋮ Critical random graphs: Diameter and mixing time ⋮ Diameters in Supercritical Random Graphs Via First Passage Percolation ⋮ The Diameter of Sparse Random Graphs ⋮ The diameter of sparse random graphs ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ The critical behavior of random digraphs ⋮ Critical random graphs and the structure of a minimum spanning tree ⋮ The asymptotic distribution of the diameter of a random mapping ⋮ The birth of geometry in exponential random graphs

This page was built for publication: