Connectivity properties of random subgraphs of the cube

DOI10.1002/rsa.3240060210zbMath0827.05053OpenAlexW2142886572MaRDI QIDQ4697813

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

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

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

Related Items (6)

Fast canonical labeling of random subgraphs ⋮ The length of random subsets of Boolean lattices ⋮ Connectivity of the k-Out Hypercube ⋮ The component structure of dense random subgraphs of the hypercube ⋮ Uniform multicommodity flows in the hypercube with random edge‐capacities ⋮ Random subgraphs of Cayley graphs over \(p\)-groups

Cites Work

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

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