Lower bounds in the combinatorial problem of Erdős and Lovász

DOI10.1134/S1064562410020341zbMath1292.05149OpenAlexW2051963929MaRDI QIDQ606577

Dmitriy A. Shabanov

Publication date: 17 November 2010

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

Full work available at URL: https://doi.org/10.1134/s1064562410020341

zbMATH Keywords

Szabó's bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items

On \(r\)-chromatic hypergraphs ⋮ On the chromatic number of simple triangle-free triple systems ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász

Cites Work

• On 3-chromatic hypergraphs
• Coloring n-sets red and blue
• On the chromatic number of set systems
• Coloring uniform hypergraphs with few edges
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Improved bounds and algorithms for hypergraph 2-coloring