scientific article; zbMATH DE number 3586242

MaRDI QIDQ4153390zbMATH OpenFDO

Authors Ju. D. Burtin

Publication date 1977

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Enumeration in graph theory (05C30)

Cited in

(14)

• Note on an extremal problem arising for unreliable networks in parallel computing
• Connectivity and dynamics for random subgraphs of the directed cube
• The filling problem in the cube
• The Evolution of Random Subgraphs of the Cube
• The component structure of dense random subgraphs of the hypercube
• Evolution of the n-cube
• Random Subgraphs in Sparse Graphs
• ``Dart calculus of induced subsets
• Resilience and reliability analysis of P2P network systems
• A review of random graphs
• Climbing up a random subgraph of the hypercube
• Topology of random -dimensional cubical complexes
• Connectivity of the k-Out Hypercube
• Random subgraphs of Cayley graphs over p-groups

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