scientific article; zbMATH DE number 795107

MaRDI QIDQ4845256zbMATH OpenFDO

Authors Noga Alon

Publication date 11 September 1995

zbMATH Keywords

expected number of edgesloopless undirected multigraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Recommendations

• scientific article; zbMATH DE number 3884207
• A Sharp Threshold for Network Reliability
• scientific article; zbMATH DE number 4213723
• Improved bounds and algorithms for graph cuts and network reliability
• Lower bound on the reliability of a network with a 2-connected structure

Cited in

(8)

• On connectivity and robustness of random graphs with inhomogeneity
• On the Power of Planned Infections in Networks
• Two-stage combinatorial optimization problems under risk
• On the approximability of robust spanning tree problems
• Rainbow connectivity and rainbow index of inhomogeneous random graphs
• The cut metric, random graphs, and branching processes
• Playing to retain the advantage
• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs

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 Q4845256)