Analytic combinatorics on random graphs

zbMATH Open1256.05222MaRDI QIDQ2906546FDOQ2906546

Authors: Michael Drmota, Bernhard Gittenberger 

Publication date: 5 September 2012

Recommendations

• Analytic combinatorics of connected graphs
• Publication:4865687
• An analogue of the Erdős-Gallai theorem for random graphs
• scientific article; zbMATH DE number 3487496
• Analytic combinatorics
• scientific article; zbMATH DE number 1943957
• The threshold for combs in random graphs
• scientific article; zbMATH DE number 3915378
• An analytic method in probabilistic combinatorics
• Problems and results in combinatorial analysis and graph theory

zbMATH Keywords

giant componentGalton-Watson branching processesrandom graph modelWright's method

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cited In (2)

• The threshold for combs in random graphs
• Selected combinatorial problems through the prism of random intersection graphs models

This page was built for publication: Analytic combinatorics on random graphs

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