Abstract
A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns an integer from {1, ... , k } to every vertex so that, in every edge, the (multi)set of colours has a unique maximum. Equivalently, for r = 3, if two vertices in an edge are assigned the same colour, then the third vertex is assigned a larger colour (as opposed to a different colour, as in classic non-monochromatic colouring). Barto, Battistelli, and Berg [STACS’21] studied LO colourings on 3-uniform hypergraphs in the context of promise constraint satisfaction problems (PCSPs). We show two results.
First, given a 3-uniform hypergraph that admits an LO 2-colouring, one can find in polynomial time an LO k-colouring with \( k=O(\sqrt [3]{n \log \log n / \log n} \).
Second, given an r-uniform hypergraph that admits an LO 2-colouring, we establish
- [1] . 2019. Simplified inpproximability of hypergraph coloring via \(t\)-agreeing families.
arXiv:1904.01163 . Retrieved from https://arxiv.org/abs/1904.01163.Google Scholar - [2] . 2020. Improved inapproximability of rainbow coloring. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’20). 1479–1495.
DOI: Google ScholarCross Ref
- [3] . 2017. (2+\(\epsilon\))-sat is NP-hard. SIAM J. Comput. 46, 5 (2017), 1554–1573.
DOI: Google ScholarDigital Library
- [4] . 2021. Symmetric promise constraint satisfaction problems: Beyond the boolean case. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS’21), LIPIcs Vol. 187. 10:1–10:16.
DOI: Google ScholarCross Ref
- [5] . 2021. Algebraic approach to promise constraint satisfaction. J. ACM 68, 4 (2021), 28:1–28:66.
DOI: Google ScholarDigital Library
- [6] . 2022. Combinatorial gap theorem and reductions between promise CSPs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’22). 1204–1220.
DOI: Google ScholarCross Ref
- [7] . 2017. Polymorphisms, and how to use them. In The Constraint Satisfaction Problem: Complexity and Approximability, and (Eds.).
Dagstuhl Follow-Ups , Vol. 7. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 1–44.DOI: Google ScholarCross Ref
- [8] . 2018. The wonderland of reflections. Isr. J. Math. 223, 1 (
February 2018), 363–398.DOI: Google ScholarCross Ref
- [9] . 1990. A better performance guarantee for approximate graph coloring. Algorithmica 5, 3 (1990), 459–466.
DOI: Google ScholarDigital Library
- [10] . 2018. NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP’18), LIPIcs Vol. 107. 15:1–15:11.
DOI: Google ScholarCross Ref
- [11] . 1994. New approximation algorithms for graph coloring. J. ACM 41, 3 (1994), 470–516.
DOI: Google ScholarDigital Library
- [12] . 2016. New hardness results for graph and hypergraph colorings. In Proceedings of the 31st Conference on Computational Complexity (CCC’16), LIPIcs Vol. 50. 14:1–14:27.
DOI: Google ScholarCross Ref
- [13] . 2021. Promise constraint satisfaction: Algebraic structure and a symmetric boolean dichotomy. SIAM J. Comput. 50, 6 (2021), 1663–1700.
DOI: Google ScholarCross Ref
- [14] . 2021. The quest for strong inapproximability results with perfect completeness. ACM Trans. Algor. 17, 3 (2021), 27:1–27:35.
DOI: Google ScholarDigital Library
- [15] . 2021. The complexity of promise SAT on non-boolean domains. ACM Trans. Comput. Theory 13, 4, Article
26 (2021).DOI: Google ScholarDigital Library
- [16] . 2013. Unique-maximum and conflict-free coloring for hypergraphs and tree graphs. SIAM J. Discr. Math. 27, 4 (2013), 1775–1787.
DOI: Google ScholarDigital Library
- [17] . 2011. Graph unique-maximum and conflict-free colorings. J. Discr. Algor. 9, 3 (2011), 241–251.
DOI: Google ScholarDigital Library
- [18] . 2008. Improved approximation guarantees through higher levels of SDP hierarchies. In Proceedings of the 11th International Workshiop on Approximation, Randomization and Combinatorial Optimization (APPROX’08),
Lecture Notes in Computer Science , Vol. 5171. Springer, 49–62.DOI: Google ScholarDigital Library
- [19] . 2009. Introduction to Algorithms, 3rd Edition. MIT Press. Google Scholar
Digital Library
- [20] . 2009. Conditional hardness for approximate coloring. SIAM J. Comput. 39, 3 (2009), 843–873.
DOI: Google ScholarDigital Library
- [21] . 2005. The hardness of 3-uniform hypergraph coloring. Comb. 25, 5 (
September 2005), 519–535.DOI: Google ScholarDigital Library
- [22] . 2010. On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors. In Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX’10), Lecture Notes in Computer Science, Vol. 6302. Springer, 138–151.
DOI: Google ScholarCross Ref
- [23] . 1976. The complexity of near-optimal graph coloring. J. ACM 23, 1 (1976), 43–49.
DOI: Google ScholarDigital Library
- [24] . 2004. On the hardness of 4-coloring a 3-colorable graph. SIAM J. Discr. Math. 18, 1 (2004), 30–40.
DOI: Google ScholarDigital Library
- [25] . 2018. Strong inapproximability results on balanced rainbow-colorable hypergraphs. Combinatorica 38, 3 (2018), 547–599.
DOI: Google ScholarDigital Library
- [26] . 2020. d-To-1 hardness of coloring 3-colorable graphs with O(1) colors. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP’20), LIPIcs Vol. 168. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 62:1–62:12.
DOI: Google ScholarCross Ref
- [27] . 2020. Rainbow coloring hardness via low sensitivity polymorphisms. SIAM J. Discr. Math. 34, 1 (2020), 520–537.
DOI: Google ScholarDigital Library
- [28] . 2000. Approximations of weighted independent set and hereditary subset problems. J. Graph Algor. Appl. 4, 1 (2000), 1–16.
DOI: Google ScholarCross Ref
- [29] . 2013. Improved hardness of approximating chromatic number. In Proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX’13). Springer, 233–243.
DOI: .arXiv:1301.5216 .Google ScholarCross Ref
- [30] . 1998. Approximate graph coloring by semidefinite programming. J. ACM 45, 2 (1998), 246–265.
DOI: Google ScholarDigital Library
- [31] . 2017. Coloring 3-colorable graphs with less than \(n^{1/5}\) colors. J. ACM 64, 1 (2017), 4:1–4:23.
DOI: Google ScholarDigital Library
- [32] . 2000. On the hardness of approximating the chromatic number. Combinatorica 20, 3 (
March 2000), 393–415.DOI: Google ScholarCross Ref
- [33] . 2000. The approximability of constraint satisfaction problems. SIAM J. Comput. 30, 6 (2000), 1863–1920.
DOI: Google ScholarDigital Library
- [34] . 2002. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC’02). ACM, 767–775.
DOI: Google ScholarDigital Library
- [35] . 2001. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. J. Algor. 41, 1 (2001), 99–113.
DOI: Google ScholarDigital Library
- [36] . 2003. Approximate coloring of uniform hypergraphs. J. Algor. 49, 1 (2003), 2–12.
DOI: Google ScholarDigital Library
- [37] . 2022. Linearly ordered colourings of hypergraphs. In 49th International Colloquium on Automata, Languages, and Programming (ICALP’22), LIPIcs Vol. 229. 128:1–128:18.
DOI: Google ScholarCross Ref
- [38] . 2022. Linearly Ordered Colourings of Hypergraphs.
Technical Report .Google Scholar Digital Library
- [39] . 1983. Improving the performance guarantee for approximate graph coloring. J. ACM 30, 4 (1983), 729–735.
DOI: Google ScholarDigital Library
- [40] . 2022. A Note on Hardness of Promise Hypergraph Colouring.
Technical Report .Google Scholar - [41] . 2020. Improved hardness for \(H\)-colourings of \(G\)-colourable graphs. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’20). 1426–1435.
DOI: Google ScholarCross Ref
Index Terms
Linearly Ordered Colourings of Hypergraphs
Recommendations
On 2-Colorings of Hypergraphs
In this article, we continue the study of 2-colorings in hypergraphs. A hypergraph is 2-colorable if there is a 2-coloring of the vertices with no monochromatic hyperedge. Let Hk denote the class of all k-uniform k-regular hypergraphs. It is known see ...
New hardness results for graph and hypergraph colorings
CCC '16: Proceedings of the 31st Conference on Computational ComplexityFinding a proper coloring of a t-colorable graph G with t colors is a classic NP-hard problem when t ≥ 3. In this work, we investigate the approximate coloring problem in which the objective is to find a proper c-coloring of G where c ≥ t. We show that ...
Complete colourings of hypergraphs
AbstractA complete c-colouring of a graph is a proper colouring in which every pair of distinct colours from [ c ] = { 1 , 2 , … , c } appears as the colours of endvertices of some edge. We consider the following generalisation of this concept ...






Comments