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

J. Beck

doi:10.1016/0012-365X(77)90140-6

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

J. Beck

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	127-131
Number of pages	5
Journal	Discrete Mathematics
Volume	17
Issue number	2
DOIs	https://doi.org/10.1016/0012-365X(77)90140-6
State	Published - 1977
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(77)90140-6

Cite this

@article{24534c2024144fc5a1f672da7c9f6c71,

title = "On a combinatorial problem of P. Erd{\"o}s and L. Lov{\'a}sz",

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{\"o}s, A. Hajnal and W.M. Schmidt.",

author = "J. Beck",

year = "1977",

doi = "10.1016/0012-365X(77)90140-6",

language = "English (US)",

volume = "17",

pages = "127--131",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

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

AU - Beck, J.

PY - 1977

Y1 - 1977

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49349132023&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49349132023&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(77)90140-6

DO - 10.1016/0012-365X(77)90140-6

M3 - Article

AN - SCOPUS:49349132023

VL - 17

SP - 127

EP - 131

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this