On a combinatorial problem of P. Erdős and L. Lovasz

DOI10.1016/0012-365X(77)90140-6zbMath0366.05042MaRDI QIDQ1241757

József Beck

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

On proper colorings of hypergraphs ⋮ On 3-chromatic hypergraphs ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ On proper colourings of hypergraphs using prescribed colours ⋮ Improvement of the lower bound in the Erdös-Hajnal combinatorial problem ⋮ Coloring non-uniform hypergraphs without short cycles

Cites Work

• Unnamed Item
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• On a property of families of sets
• On a combinatorial problem. II