Sciweavers

RSA
1998
105views more  RSA 1998»
13 years 10 months ago
The chromatic numbers of random hypergraphs
: 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 ...
Michael Krivelevich, Benny Sudakov