Approximate coloring of uniform hypergraphs

DOI10.1016/S0196-6774(03)00077-4MaRDI QIDQ4820902zbMATHOpenAlexFDO

Authors Michael Krivelevich, Benny Sudakov

Publication date 1 October 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00077-4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 1305101
• Approximate hypergraph coloring
• Coloring uniform hypergraphs with few colors
• Coloring uniform hypergraphs with few edges
• Hardness of Approximate Hypergraph Coloring
• Greedy colorings of uniform hypergraphs
• Approximate hypergraph coloring under low-discrepancy and related promises
• Colourings of uniform hypergraphs with large girth and applications

Cited in

(12)

• scientific article; zbMATH DE number 1947044 (Why is no real title available?)
• Linearly ordered colourings of hypergraphs
• Approximations to m‐Colored Complete Infinite Hypergraphs
• The hardness of 3-uniform hypergraph coloring
• scientific article; zbMATH DE number 5825874 (Why is no real title available?)
• Approximating Independent Set and Coloring in Random Uniform Hypergraphs
• Edge-coloring of 3-uniform hypergraphs
• Extended box clustering for classification problems
• Approximating coloring and maximum independent sets in 3-uniform hypergraphs
• Longest common subsequence problem for unoriented and cyclic strings
• Approximability of the upper chromatic number of hypergraphs
• The complexity of 2-coloring and strong coloring in uniform hypergraphs with high degrees

This page was built for publication: Approximate coloring of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820902)