The Evolution of Random Subgraphs of the Cube
From MaRDI portal
Publication:3989741
DOI10.1002/rsa.3240030106zbMath0779.05045OpenAlexW2075997628MaRDI QIDQ3989741
Yoshiharu Kohayakawa, Tomasz Łuczak, Béla Bollobás
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
Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
The diameter of a random subgraph of the hypercube, Phase transition phenomena in random discrete structures, Fast canonical labeling of random subgraphs, Random subcube intersection graphs. I: Cliques and covering, The evolution of the random reversal graph, Connectivity of the k-Out Hypercube, The giant component after percolation of product graphs, The component structure of dense random subgraphs of the hypercube, Self‐avoiding walk on the hypercube, Supercritical site percolation on the hypercube: small components are small, Random induced subgraphs of Cayley graphs induced by transpositions, Component behaviour and excess of random bipartite graphs near the critical point, Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities, Unlacing hypercube percolation: a survey, The \(Q_2\)-free process in the hypercube, Majority Bootstrap Percolation on the Hypercube, On the critical probability in percolation, Bootstrap Percolation in High Dimensions, Hypercube percolation, Uniform multicommodity flows in the hypercube with random edge‐capacities, Percolation on dense graph sequences, Clique percolation, Connectivity properties of random subgraphs of the cube, Large components in random induced subgraphs of \(n\)-cubes, Random subgraphs of Cayley graphs over \(p\)-groups, Expansion in supercritical random subgraphs of the hypercube and its consequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact face-isoperimetric inequalities
- Largest random component of a k-cube
- The transitive closure of a random digraph
- Complete matchings in random subgraphs of the cube
- The Evolution of Random Graphs
- Component behavior near the critical point of the random graph process
- Functional Composition Patterns and Power Series Reversion
