Miller was the first to investigate the problem of the chromatic number of set-systems. In the present paper I give a condition concerning the number of edges, which implies that the chromatic number of the n-graph equals 2. This result is sharper than the earlier results obtained by P. Erdös, A. Hajnal and W.M. Schmidt.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics