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)

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

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)