On the chromatic number of finite systems of subsets

DOI10.1134/S0001434609050332zbMath1191.05044OpenAlexW1999854554MaRDI QIDQ1034015

Dmitriy A. Shabanov

Publication date: 10 November 2009

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmchromatic number\(n\)-uniform hypergraphrandom coloring method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Extremal problems in hypergraph colourings ⋮ Lower bounds for the number of edges in hypergraphs of certain classes ⋮ On \(r\)-chromatic hypergraphs ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász

Cites Work

• Unnamed Item
• Hypergraphs with high chromatic number
• On 3-chromatic hypergraphs
• Coloring n-sets red and blue
• Coloring uniform hypergraphs with few colors
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II

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