Critical subgraphs of a random graph
type: Item
instance of: scholarly article
title: Critical subgraphs of a random graph
zbMATH Open document ID: 0943.05074
published in: The Electronic Journal of Combinatorics
publication date: 2000-01-16T00:00:00Z
full work available at URL: https://eudml.org/doc/120466
full work available at URL: v6i1r35.html
review text: Consider \(n\) vertices and a graph process obtained by successively inserting edges at random. The threshold for a graph that is almost surely \(k\)-colorable is compared to the threshold for the appearance of a \(k\)-core.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1345965
zbMATH Keywords: critical subgraphs
zbMATH Keywords: random graph
zbMATH Keywords: chromatic number
author: Michael Molloy
author: Bruce Reed
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1345965