Avoiding a giant component

DOI10.1002/RSA.1019zbMath0986.05091OpenAlexW2095403663WikidataQ57401532 ScholiaQ57401532MaRDI QIDQ2748427

Tom Bohman, Alan M. Frieze

Publication date: 6 June 2002

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.1019

zbMATH Keywords

random graphs

Mathematics Subject Classification ID

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

Related Items (35)

Addendum to ‘avoiding a giant component’ ⋮ Product rule wins a competitive game ⋮ Getting a Directed Hamilton Cycle Two Times Faster ⋮ Random k -SAT and the power of two choices ⋮ The evolution of subcritical Achlioptas processes ⋮ Explosive percolation in the human protein homology network ⋮ On the Power of Choice for Boolean Functions ⋮ Sharp thresholds for half-random games I ⋮ A geometric Achlioptas process ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Given enough choice, simple local rules percolate discontinuously ⋮ Sharp thresholds in adaptive random graph processes ⋮ Convergence of Achlioptas Processes via Differential Equations with Unique Solutions ⋮ Achlioptas process phase transitions are continuous ⋮ Connected components and evolution of random graphs: An algebraic approach ⋮ The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs ⋮ Choice-driven phase transition in complex networks ⋮ Explosive Percolation in Erdős–Rényi-Like Random Graph Processes ⋮ Critical random graphs and the differential equations technique ⋮ Birth control for giants ⋮ Recent advances in percolation theory and its applications ⋮ Phase transitions for modified Erdős--Rényi processes ⋮ Small subgraphs in random graphs and the power of multiple choices ⋮ Aggregation models with limited choice and the multiplicative coalescent ⋮ Coloring the edges of a random graph without a monochromatic giant component ⋮ Hamiltonicity thresholds in Achlioptas processes ⋮ Avoiding small subgraphs in Achlioptas processes ⋮ Ramsey games with giants ⋮ Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process ⋮ The Kőnig graph process ⋮ Bounded-Size Rules: The Barely Subcritical Regime ⋮ The Bohman-Frieze process near criticality ⋮ Delaying satisfiability for random 2SAT ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs

This page was built for publication: Avoiding a giant component