Coloring 3-colorable graphs with o(n 1/5 ) colors

DOI10.4230/LIPIcs.STACS.2014.458zbMath1359.05123OpenAlexW2103935895MaRDI QIDQ2965508

Ken-ichi Kawarabayashi, Mikkel Thorup

Publication date: 3 March 2017

Full work available at URL: https://doi.org/10.4230/lipics.stacs.2014.458

zbMATH Keywords

graph coloringapproximation algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes ⋮ Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors ⋮ Approximately coloring graphs without long induced paths ⋮ Finding Pseudorandom Colorings of Pseudorandom Graphs

This page was built for publication: Coloring 3-colorable graphs with o(n 1/5 ) colors