Memoryless rules for Achlioptas processes

DOI10.1137/070684148MaRDI QIDQ3563955zbMATH OpenOpenAlexWikidataFDO

Authors Andrew Beveridge, Tom Bohman, Oleg Pikhurko, Alan Frieze

Publication date 1 June 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ca924fcb324fff357376bbe6844a5e9b36f83c6e

zbMATH Keywords

Achlioptas processmemoryless

Mathematics Subject Classification ID

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

Recommendations

• Creating a Giant Component
• A geometric Achlioptas process
• Connectivity thresholds for bounded size rules
• The evolution of subcritical Achlioptas processes
• Avoiding small subgraphs in Achlioptas processes

Cited in

(8)

• Ramsey games with giants
• The evolution of subcritical Achlioptas processes
• Connectivity thresholds for bounded size rules
• Avoiding small subgraphs in Achlioptas processes
• On the power of choice for Boolean functions
• Product rule wins a competitive game
• Fast construction on a restricted budget
• A geometric Achlioptas process

This page was built for publication: Memoryless rules for Achlioptas processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563955)