Hostname: page-component-7c8c6479df-8mjnm Total loading time: 0 Render date: 2024-03-28T16:22:28.238Z Has data issue: false hasContentIssue false

On the Choice Number of Random Hypergraphs

Published online by Cambridge University Press:  01 January 2000

VAN H. VU
Affiliation:
Microsoft Research, Microsoft Corp., Redmond, WA 98052, USA (e-mail: vanhavu@microsoft.com)

Abstract

We generalize the notion of choice number from graphs to hypergraphs and estimate the sharp order of magnitude of the choice number of random hypergraphs. It turns out that the choice number and the chromatic number of a random hypergraph have the same order of magnitude, almost surely. Our result implies an earlier bound on the chromatic number of random hypergraphs, proved by Schmidt [23] using a different method.

Type
Research Article
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)