Ramsey games with giants
From MaRDI portal
Publication:3068759
DOI10.1002/rsa.20343zbMath1215.05157arXiv0907.5590OpenAlexW1995753621WikidataQ57401451 ScholiaQ57401451MaRDI QIDQ3068759
Po-Shen Loh, Tom Bohman, Michael Krivelevich, Benjamin Sudakov, Alan M. Frieze
Publication date: 17 January 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.5590
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (6)
The evolution of subcritical Achlioptas processes ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Partitioning random graphs into monochromatic components ⋮ Thresholds for extreme orientability ⋮ Hamiltonicity thresholds in Achlioptas processes
Cites Work
- Unnamed Item
- Unnamed Item
- Eigenvalue problems of Nordhaus--Gaddum type
- Birth control for giants
- The triangle-free process
- The longest path in a random graph
- Differential equations for random processes and random graphs
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Avoiding a giant component
- Hamiltonicity thresholds in Achlioptas processes
- Some Inequalities for the Largest Eigenvalue of a Graph
- Upper Bounds for Online Ramsey Games in Random Graphs
- Online Ramsey Games in Random Graphs
- Memoryless Rules for Achlioptas Processes
- Avoiding small subgraphs in Achlioptas processes
- Ramsey Games Against a One-Armed Bandit
- Product rule wins a competitive game
- Creating a Giant Component
- The phase transition in inhomogeneous random graphs
- A phase transition for avoiding a giant component
- Embracing the giant component
- Coloring the edges of a random graph without a monochromatic giant component
This page was built for publication: Ramsey games with giants
