scientific article; zbMATH DE number 1380601

DOI10.1002/(SICI)1098-2418(199810/12)13:3/4%3C485::AID-RSA16%3E3.0.CO;2-YMaRDI QIDQ4705337zbMATH OpenFDO

Authors Tomasz Łuczak

Publication date 19 December 1999

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4%3C485::AID-RSA16%3E3.0.CO;2-Y

zbMATH Keywords

asymptotic behaviordiameterrandom graphtrees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 798854
• The diameter of sparse random graphs
• Random trees in a graph and trees in a random graph
• The diameter of sparse random graphs
• The diameter of a random graph with bounded diameter

Cited in

(27)

• The block connectivity of random trees
• The asymptotic distribution of the diameter of a random mapping
• Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?
• Tree components in random distance graphs of special form
• The average distance and the diameter of dense random regular graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• The continuum limit of critical random graphs
• On the tree-depth of random graphs
• Noise sensitivity of critical random graphs
• The critical behavior of random digraphs
• Critical random graphs and the structure of a minimum spanning tree
• Ascents and descents in random trees
• Random trees in a graph and trees in a random graph
• Mixing time of near-critical random graphs
• On random cartesian trees
• scientific article; zbMATH DE number 798854 (Why is no real title available?)
• Diameters in supercritical random graphs via first passage percolation
• The diameter of sparse random graphs
• On large‐girth regular graphs and random processes on trees
• Analytical results for the distribution of cover times of random walks on random regular graphs
• Resistance distance distribution in large sparse random graphs
• The birth of geometry in exponential random graphs
• On Induced Paths, Holes, and Trees in Random Graphs
• The diameter of sparse random graphs
• Linear colouring of binomial random graphs
• On random trees obtained from permutation graphs
• Critical random graphs: Diameter and mixing time

This page was built for publication:

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