Improved linearly ordered colorings of hypergraphs via SDP rounding (2405.00427v2)
Abstract: We consider the problem of linearly ordered (LO) coloring of hypergraphs. A hypergraph has an LO coloring if there is a vertex coloring, using a set of ordered colors, so that (i) no edge is monochromatic, and (ii) each edge has a unique maximum color. It is an open question as to whether or not a 2-LO colorable 3-uniform hypergraph can be LO colored with 3 colors in polynomial time. Nakajima and \v{Z}ivn\'{y} recently gave a polynomial-time algorithm to color such hypergraphs with $\widetilde{O}(n{1/3})$ colors and asked if SDP methods can be used directly to obtain improved bounds. Our main result is to show how to use SDP-based rounding methods to produce an LO coloring with $\widetilde{O}(n{1/5})$ colors for such hypergraphs. We show how to reduce the problem to cases with highly structured SDP solutions, which we call balanced hypergraphs. Then, we discuss how to apply classic SDP-rounding tools to obtain improved bounds.
- New approximation guarantee for chromatic number. In Proceedings of the thirty-eighth Annual ACM Symposium on Theory of Computing (STOC), pages 215–224, 2006.
- Coloring 2-colorable hypergraphs with a sublinear number of colors. Nordic Journal of Computing, 3:425–439, 1996.
- Symmetric promise constraint satisfaction problems: Beyond the Boolean case. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 187 of LIPIcs, pages 10:1–10:16, 2021.
- Algebraic approach to promise constraint satisfaction. Journal of the ACM, 68(4):28:1–28:66, 2021.
- An algorithmic blend of LPs and ring equations for promise CSPs. In Proceedings of the thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 436–455, 2019.
- Promise constraint satisfaction: Algebraic structure and a symmetric Boolean dichotomy. SIAM Journal on Computing, 50(6):1663–1700, 2021.
- An O(n3/14)𝑂superscript𝑛314{O}(n^{3/14})italic_O ( italic_n start_POSTSUPERSCRIPT 3 / 14 end_POSTSUPERSCRIPT )-coloring algorithm for 3-colorable graphs. Information Processing Letters, 61(1):49–53, 1997.
- Avrim Blum. New approximation algorithms for graph coloring. Journal of the ACM, 41(3):470–516, 1994.
- Alex Brandts. Promise constraint satisfaction problems. PhD thesis, University of Oxford, 2022.
- Coloring bipartite hypergraphs. In International Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 345–358, 1996.
- Graph unique-maximum and conflict-free colorings. Journal of Discrete Algorithms, 9(3):241–251, 2011.
- Conditional hardness for approximate coloring. In Proceedings of the thirty-eighth Annual ACM Symposium on Theory of Computing (STOC), pages 344–353, 2006.
- The hardness of 3-uniform hypergraph coloring. Combinatorica, 25(5):519–535, 2005.
- Dichotomy for symmetric Boolean PCSPs. In 46th International Colloquium on Automata, Languages, and Programming (ICALP), volume 132 of LIPIcs, pages 57:1–57:12, 2019.
- Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science, (STACS), volume 289 of LIPIcs, pages 34:1–34:19, 2024.
- Magnús M. Halldórsson. Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms Appl., 4(1):1–16, 2000.
- Ordered colourings. Discrete Mathematics, 1(142):141–154, 1995.
- Approximate graph coloring by semidefinite programming. Journal of the ACM, 45(2):246–265, 1998.
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs. Journal of Algorithms, 41(1):99–113, 2001.
- Coloring 3-colorable graphs with less than n1/51/5{}^{\mbox{1/5}}start_FLOATSUPERSCRIPT 1/5 end_FLOATSUPERSCRIPT colors. Journal of the ACM, 64(1):4:1–4:23, 2017.
- Linearly ordered colourings of hypergraphs. ACM Trans. Comput. Theory, 14(3-4):1–19, 2022.
- Avi Wigderson. Improving the performance guarantee for approximate graph coloring. Journal of the ACM, 30(4):729–735, 1983.
- The Design of Approximation Algorithms. Cambridge University Press, 2011.
- Improved hardness for H-colourings of G-colourable graphs. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, (SODA), pages 1426–1435, 2020.