A note on the random greedy independent set algorithm
type: Item
instance of: scholarly article
title: A note on the random greedy independent set algorithm
zbMATH Open document ID: 1349.05314
author: Patrick Bennett
author: Tom Bohman
publication date: 2016-11-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1308.3732
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6650082
zbMATH Keywords: hypergraph independence number
zbMATH Keywords: randomized algorithms
zbMATH Keywords: Turán problem
MaRDI profile type: Publication
OpenAlex ID: W1755426982
arXiv ID: 1308.3732
cites work: Extremal uncrowded hypergraphs
cites work: The triangle-free process
cites work: A note on the random greedy triangle-packing algorithm
cites work: Random triangle removal
cites work: The early evolution of the \(H\)-free process
cites work: SIR epidemics on random graphs with a fixed degree sequence
cites work: On uncrowded hypergraphs
cites work: On tail probabilities for martingales
cites work: No dense subgraphs appear in the triangle-free graph process
cites work: Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
cites work: The diamond-free process
cites work: The Final Size of theC4-Free Process
cites work: The Final Size of the $C_{\ell}$-free Process
cites work: Hamiltonicity of random graphs produced by 2‐processes
cites work: Dense subgraphs in the \(H\)-free process
cites work: The Cℓ‐free process
cites work: When does the K4‐free process stop?
cites work: Triangle‐free subgraphs in the triangle‐free process
DOI: 10.1002/RSA.20667
published in: Random Structures \& Algorithms
description: scientific article; zbMATH DE number 6650082