Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

RSA
1998

favoriteEmaildiscussreport

105views more RSA 1998»

The chromatic numbers of random hypergraphs

13 years 4 months ago

The chromatic numbers of random hypergraphs

Download www.math.ucla.edu

: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T , . . . , T such that elT F␥ for every egE. In this paper we determine the asymptotic1 k i Ž .behavior of the ␥-chromatic number of the random r-uniform hypergraph H n, p for allr

Michael Krivelevich, Benny Sudakov

Real-time Traffic

.hypergraph Hs | Elt F␥ | RSA 1998 | ␥-chromatic Number |

claim paper

Related Content

» Circular Chromatic Number of Hypergraphs

» CPerfect KUniform Hypergraphs

» Dichotomy theorems for countably infinite dimensional analytic hypergraphs

» On the chromatic number and independence number of hypergraph products

» The chromatic number of almost stable Kneser hypergraphs

» The game chromatic number of random graphs

» Approximate Counting of Matchings in Sparse Hypergraphs

» Strong Refutation Heuristics for Random kSAT

» Colouring Planar Mixed Hypergraphs

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	RSA
Authors	Michael Krivelevich, Benny Sudakov

Comments (0)