On the chromatic number of set systems
From MaRDI portal
Publication:2748418
DOI10.1002/rsa.1020zbMath0984.05073MaRDI QIDQ2748418
Vojtěch Rödl, Dhruv Mubayi, Alexandr V. Kostochka, Prasad Tetali
Publication date: 10 February 2002
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.1020
Related Items
Lower bounds in the combinatorial problem of Erdős and Lovász, Lower bounds for the number of edges in hypergraphs of certain classes, On \(r\)-chromatic hypergraphs, On cycle systems with specified weak chromatic number, Coloring H-free hypergraphs, Constructions of sparse uniform hypergraphs with high chromatic number, Random coloring method in the combinatorial problem of Erdős and Lovász, The Lovász Local Lemma and Satisfiability
Cites Work