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

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)127-131
Number of pages5
JournalDiscrete Mathematics
Volume17
Issue number2
DOIs
StatePublished - 1977
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'On a combinatorial problem of P. Erdös and L. Lovász'. Together they form a unique fingerprint.

Cite this