Lower bounds in the combinatorial problem of Erdős and Lovász
From MaRDI portal
Publication:606577
DOI10.1134/S1064562410020341zbMath1292.05149OpenAlexW2051963929MaRDI QIDQ606577
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
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