Approximate coloring of uniform hypergraphs

DOI10.1016/S0196-6774(03)00077-4zbMATH Open1064.68071OpenAlexW2164744913MaRDI QIDQ4820902FDOQ4820902

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

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
• On the chromatic number of simple triangle-free triple systems

Mathematics Subject Classification ID

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

Cited In (11)

• Edge-coloring of 3-uniform hypergraphs
• Extended box clustering for classification problems
• Approximations to m‐Colored Complete Infinite Hypergraphs
• The complexity of 2-coloring and strong coloring in uniform hypergraphs with high degrees
• Longest common subsequence problem for unoriented and cyclic strings
• The hardness of 3-uniform hypergraph coloring
• Approximating Independent Set and Coloring in Random Uniform Hypergraphs
• Title not available (Why is that?)
• Approximability of the upper chromatic number of hypergraphs
• Title not available (Why is that?)
• Approximating coloring and maximum independent sets in 3-uniform hypergraphs

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)