On the chromatic number of set systems
Article first published online: 17 AUG 2001
DOI: 10.1002/rsa.1020
Copyright © 2001 John Wiley & Sons, Inc.
Additional Information
How to Cite
Kostochka, A., Mubayi, D., Rödl, V. and Tetali, P. (2001), On the chromatic number of set systems. Random Structures & Algorithms, 19: 87–98. doi: 10.1002/rsa.1020
Publication History
- Issue published online: 17 AUG 2001
- Article first published online: 17 AUG 2001
- Manuscript Accepted: 6 MAR 2001
- Manuscript Received: 24 NOV 2000
Funded by
- RFBR. Grant Numbers: 99-01-00581, 00-01-00916
- NSF. Grant Numbers: DMS9970325, DMS0071261, DMS9800351
- Abstract
- References
- Cited By
Keywords:
- extremal set theory;
- uniform hypergraph;
- property B
Abstract
An (r, l)-system is an r-uniform hypergraph in which every set of l vertices lies in at most one edge. Let mk(r, l) be the minimum number of edges in an (r, l)-system that is not k-colorable. Using probabilistic techniques, we prove that
where br, l is explicitly defined and ar, l is sufficiently small. We also give a different argument proving (for even k)
where a′r, l=(r−l+1)/r(2r−1re)−l/(l−1).
Our results complement earlier results of Erdős and Lovász [10] who mainly focused on the case l=2, k fixed, and r large. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19: 87–98, 2001

1098-2418/asset/RSA_centre.gif?v=1&s=6e9e56b0bda739ac652768ef6b9d85a5d42c3f17)
1098-2418/asset/cover.gif?v=1&s=8c37a8c420571f9d82e3fc7c4b0d96e07641b77f)

