Sign in
Back
On a combinatorial problem of P. Erdös and L. Lovász
Journal article   Open access  Peer reviewed

On a combinatorial problem of P. Erdös and L. Lovász

J Beck
Discrete mathematics, Vol.17(2), pp.127-131
1977
DOI: https://doi.org/10.1016/0012-365X(77)90140-6

Abstract

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.
url
https://doi.org/10.1016/0012-365X(77)90140-6View
Version of Record (VoR) Open

Metrics

4 Record Views
8 Times Cited - Web of Science

Details