On 3-chromatic hypergraphs
暂无分享，去创建一个
Abstract Let F be uniform hypergraph. In the present paper I prove that of | F | 1 3 4 2 then the chromatic number of F is equal to 2. I have a result in the general (not necessarily uniform) case too.
[1] J. Beck,et al. On a combinatorial problem of P. Erdös and L. Lovász , 1977, Discret. Math..
[2] P. Erdos. On a combinatorial problem. II , 1964 .
[3] de Ng Dick Bruijn. A combinatorial problem , 1946 .