Efficient Linearly Ordered Colorings of Hypergraphs via Semidefinite Programming Rounding

This paper presents an improved algorithm for linearly ordered (LO) coloring of 2-LO colorable 3-uniform hypergraphs, using semidefinite programming (SDP) rounding techniques to achieve a significantly better bound on the number of colors used compared to prior work.