Connectivity properties of random subgraphs of the cube

DOI10.1002/RSA.3240060210MaRDI QIDQ4697813zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Łuczak

Publication date 27 November 1995

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240060210

zbMATH Keywords

connectivitycuberandom subgraphs

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 4059455
• scientific article; zbMATH DE number 747047
• Evolution of the n-cube
• On the diameter and radius of randon subgraphs of the cube

Cites work

• Complete matchings in random subgraphs of the cube
• Largest random component of a k-cube
• Mengerian theorems for paths of bounded length
• Radius and diameter of random subgraphs of the hypercube
• The Evolution of Random Subgraphs of the Cube

Cited in

(12)

• Random subgraphs of Cayley graphs over p-groups
• Fast canonical labeling of random subgraphs
• Complete matchings in random subgraphs of the cube
• scientific article; zbMATH DE number 26595 (Why is no real title available?)
• Connectivity of the k-Out Hypercube
• The length of random subsets of Boolean lattices
• Uniform multicommodity flows in the hypercube with random edge‐capacities
• Minimum connected dominating sets of random cubic graphs
• The component structure of dense random subgraphs of the hypercube
• Connectivity and dynamics for random subgraphs of the directed cube
• Minimum degree k and k-connectedness usually arrive together
• Survival time of a random graph

This page was built for publication: Connectivity properties of random subgraphs of the cube

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