The Evolution of Random Subgraphs of the Cube
From MaRDI portal
Publication:3989741
DOI10.1002/RSA.3240030106zbMATH Open0779.05045OpenAlexW2075997628MaRDI QIDQ3989741FDOQ3989741
Authors: Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Łuczak
Publication date: 28 June 1992
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240030106
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cites Work
- Title not available (Why is that?)
- Functional Composition Patterns and Power Series Reversion
- Component behavior near the critical point of the random graph process
- The transitive closure of a random digraph
- The Evolution of Random Graphs
- Largest random component of a k-cube
- Exact face-isoperimetric inequalities
- Title not available (Why is that?)
- Complete matchings in random subgraphs of the cube
- Title not available (Why is that?)
Cited In (36)
- Large components in random induced subgraphs of \(n\)-cubes
- Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities
- Title not available (Why is that?)
- Connectivity and dynamics for random subgraphs of the directed cube
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- The \(Q_2\)-free process in the hypercube
- Supercritical site percolation on the hypercube: small components are small
- Hypercube percolation
- Clique percolation
- The component structure of dense random subgraphs of the hypercube
- Fast canonical labeling of random subgraphs
- Evolution of the \(n\)-cube
- A branching process with deletions and mergers that matches the threshold for hypercube percolation
- Unlacing hypercube percolation: a survey
- On the critical probability in percolation
- Random subcube intersection graphs. I: Cliques and covering
- Supercritical percolation on finite transitive graphs I: uniqueness of the giant component
- Expansion in supercritical random subgraphs of expanders and its consequences
- Complete matchings in random subgraphs of the cube
- Majority Bootstrap Percolation on the Hypercube
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
- Percolation on irregular high-dimensional product graphs
- The giant component after percolation of product graphs
- The evolution of the random reversal graph
- Uniform multicommodity flows in the hypercube with random edge‐capacities
- The diameter of a random subgraph of the hypercube
- Self‐avoiding walk on the hypercube
- Climbing up a random subgraph of the hypercube
- Phase transition phenomena in random discrete structures
- Percolation on dense graph sequences
- Bootstrap percolation in high dimensions
- Connectivity properties of random subgraphs of the cube
- Random induced subgraphs of Cayley graphs induced by transpositions
- Connectivity of the k-Out Hypercube
- Random subgraphs of Cayley graphs over \(p\)-groups
- Component behaviour and excess of random bipartite graphs near the critical point
This page was built for publication: The Evolution 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 Q3989741)