The component structure of dense random subgraphs of the hypercube
From MaRDI portal
Publication:6074646
DOI10.1002/rsa.20990arXiv1806.06433OpenAlexW3130725909MaRDI QIDQ6074646
Paul Withers, Colin J. H. McDiarmid, Alexander D. Scott
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.06433
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
- Largest random component of a k-cube
- Evolution of the \(n\)-cube
- Complete matchings in random subgraphs of the cube
- Poisson Convergence in the n‐Cube
- Matchings and walks in graphs
- The Evolution of Random Subgraphs of the Cube
- On the diameter and radius of randon subgraphs of the cube
- Connectivity properties of random subgraphs of the cube
- Paths in graphs
- Slightly subcritical hypercube percolation
- Uniform multicommodity flows in the hypercube with random edge‐capacities
This page was built for publication: The component structure of dense random subgraphs of the hypercube