Largest random component of a k-cube

DOI10.1007/BF02579276zbMath0489.05053WikidataQ29041843 ScholiaQ29041843MaRDI QIDQ1166544

Endre Szemerédi, János Komlós, Miklós Ajtai

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

random cube

Mathematics Subject Classification ID

60C05: Combinatorial probability

05C99: Graph theory

05C40: Connectivity

Related Items

Connectivity properties of random subgraphs of the cube, Bootstrap Percolation in High Dimensions, The giant component threshold for random regular graphs with edge faults H. Prodinger, Extreme values for two-dimensional discrete Gaussian free field, Random induced subgraphs of Cayley graphs induced by transpositions, A phase transition for the metric distortion of percolation on the hypercube, Large components in random induced subgraphs of \(n\)-cubes, Acyclic orientations of random graphs, Phase transition phenomena in random discrete structures, Generic properties of combinatory maps: Neutral networks of RNA secondary structures, Random induced subgraphs of generalized \(n\)-cubes, Random subgraphs of Cayley graphs over \(p\)-groups, Percolation on finite graphs and isoperimetric inequalities., Percolation on dense graph sequences, Unlacing hypercube percolation: a survey, Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees, Mean-field conditions for percolation on finite graphs, Clique percolation, The diameter of a random subgraph of the hypercube, Majority Bootstrap Percolation on the Hypercube, The Evolution of Random Subgraphs of the Cube

Cites Work

• Unnamed Item
• The longest path in a random graph
• Evolution of the \(n\)-cube
• Optimal numberings and isoperimetric problems on graphs