Approximate coloring of uniform hypergraphs

DOI10.1016/S0196-6774(03)00077-4zbMath1064.68071OpenAlexW2164744913MaRDI QIDQ4820902

Michael Krivelevich, Benjamin 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

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

Related Items (3)

Longest common subsequence problem for unoriented and cyclic strings ⋮ Approximating Independent Set and Coloring in Random Uniform Hypergraphs ⋮ Extended box clustering for classification problems

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