Almost all graphs with 1.44n edges are 3-colorable
type: Item
instance of: scholarly article
title: Almost all graphs with 1.44n edges are 3-colorable
zbMATH Open document ID: 0715.05026
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 4177088
zbMATH Keywords: uniform asymptotic approximation
zbMATH Keywords: 3-colorable
MaRDI profile type: Publication
full work available at URL: rsa.3240020103
OpenAlex ID: W2077154649
cites work: Q5808632
cites work: Many hard examples for resolution
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: On circuits and subgraphs of chromatic graphs
cites work: An Asymptotic Formula for the Differences of the Powers at Zero
cites work: Q3243274
cites work: Coupon Collecting for Uneqal Probabilities
DOI: 10.1002/RSA.3240020103
published in: Random Structures \& Algorithms
description: scientific article