Avoiding a giant component

From MaRDI portal
Publication:2748427

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




Related Items (35)

Addendum to ‘avoiding a giant component’Product rule wins a competitive gameGetting a Directed Hamilton Cycle Two Times FasterRandom k -SAT and the power of two choicesThe evolution of subcritical Achlioptas processesExplosive percolation in the human protein homology networkOn the Power of Choice for Boolean FunctionsSharp thresholds for half-random games IA geometric Achlioptas processThe Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)Given enough choice, simple local rules percolate discontinuouslySharp thresholds in adaptive random graph processesConvergence of Achlioptas Processes via Differential Equations with Unique SolutionsAchlioptas process phase transitions are continuousConnected components and evolution of random graphs: An algebraic approachThe augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphsChoice-driven phase transition in complex networksExplosive Percolation in Erdős–Rényi-Like Random Graph ProcessesCritical random graphs and the differential equations techniqueBirth control for giantsRecent advances in percolation theory and its applicationsPhase transitions for modified Erdős--Rényi processesSmall subgraphs in random graphs and the power of multiple choicesAggregation models with limited choice and the multiplicative coalescentColoring the edges of a random graph without a monochromatic giant componentHamiltonicity thresholds in Achlioptas processesAvoiding small subgraphs in Achlioptas processesRamsey games with giantsVery fast construction of bounded‐degree spanning graphs via the semi‐random graph processThe Kőnig graph processBounded-Size Rules: The Barely Subcritical RegimeThe Bohman-Frieze process near criticalityDelaying satisfiability for random 2SATThe stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degreesWaiter-client and client-waiter Hamiltonicity games on random graphs




This page was built for publication: Avoiding a giant component