On the chromatic number of set systems

DOI10.1002/rsa.1020zbMath0984.05073OpenAlexW2145194305MaRDI QIDQ2748418

Dhruv Mubayi, Vojtěch Rödl, 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

zbMATH Keywords

extremal set theoryuniform hypergraphsproperty B

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Lower bounds in the combinatorial problem of Erdős and Lovász ⋮ Block avoiding point sequencings of partial Steiner systems ⋮ Improved algorithms for colorings of simple hypergraphs and applications ⋮ Erdős-Hajnal problem for \(H\)-free hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Lower bounds for the number of edges in hypergraphs of certain classes ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ On cycle systems with specified weak chromatic number ⋮ On \(r\)-chromatic hypergraphs ⋮ Regular Behavior of the Maximal Hypergraph Chromatic Number ⋮ Coloring H-free hypergraphs ⋮ Constructions of sparse uniform hypergraphs with high chromatic number ⋮ Coloring hypergraphs with bounded cardinalities of edge intersections ⋮ The Lovász Local Lemma and Satisfiability ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász ⋮ \(F\)-factors in hypergraphs via absorption

Cites Work

• Unnamed Item
• Hypergraphs with high chromatic number
• On 3-chromatic hypergraphs
• Extremal uncrowded hypergraphs
• The minimum independence number for designs
• Note on independent sets in steiner systems
• On uncrowded hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• On A Combinatorial Problem of Erdös
• On a combinatorial problem. II

This page was built for publication: On the chromatic number of set systems