Abstract
Let
F
be uniform hypergraph. In the present paper I prove that of
|
F| < n
1
3
42
then the chromatic number of
F
is equal to 2. I have a result in the general (not necessarily uniform) case too.
- Title
- On 3-chromatic hypergraphs
- Creators
- J Beck - Mathematical Institute of the Hungarian Academy of Sciences, Budapest V. Reahanoden, 13-15, Hungary
- Publication Details
- Discrete mathematics, Vol.24(2), pp.127-137
- Date published
- 1978
- Publisher
- Elsevier B.V
- Academic Unit
- Mathematics (SAS)
- Language
- English
- Resource Type
- Journal article
- Identifiers
- 991031665447204646