Choosability in random hypergraphs
type: Item
instance of: scholarly article
title: Choosability in random hypergraphs
zbMATH Open document ID: 1023.05060
author: Michael Krivelevich
author: Van Vu
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 1843791
zbMATH Keywords: choice number
zbMATH Keywords: color lists
zbMATH Keywords: choice function
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
OpenAlex ID: W1978476471
cites work: Q3142409
cites work: List coloring of random and pseudo-random graphs
cites work: Q4004078
cites work: An algorithmic approach to the Lovász local lemma. I
cites work: The chromatic number of random graphs
cites work: The Choice Number of Dense Random Graphs
cites work: Q4705318
cites work: On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
cites work: On the Choice Number of Random Hypergraphs
DOI: 10.1006/JCTB.2001.2053
description: scientific article; zbMATH DE number 1843791