Libor Barto
ABSTRACT
We use a connection between polymorphisms and the structure of smooth digraphs to prove the conjecture of Bang-Jensen and Hell from 1990 and, as a consequence, a conjecture of Bang-Jensen, Hell and MacGillivray from 1995. The conjectured characterization of computationally complex coloring problems for smooth digraphs is proved using tools of universal algebra. We cite further graph results obtained using this new approach. The proofs are based in an universal algebraic framework developed for the Constraint Satisfaction Problem and the CSP dichotomy conjecture of Feder and Vardi in particular.
- Jørgen Bang-Jensen and Pavol Hell. The effect of two cycles on the complexity of colourings by directed graphs. Discrete Appl. Math., 26(1):1--23, 1990.]] Google Scholar
Digital Library
- Jørgen Bang-Jensen, Pavol Hell, and Gary MacGillivray. Hereditarily hard $H$-colouring problems. Discrete Math., 138(1-3):75--92, 1995. 14th British Combinatorial Conference (Keele, 1993).]] Google ScholarDigital Library
- Libor Barto, Marcin Kozik, Miklós Maróti, and Todd Niven. Csp dichotomy for special triads. in preparation.]]Google Scholar
- Libor Barto, Marcin Kozik, and Todd Niven. The csp dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of bang-jensen and hell). submitted.]]Google Scholar
- Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34(3):720--742 (electronic), 2005.]] Google ScholarDigital Library
- Andrei A. Bulatov. H-coloring dichotomy revisited. Theoret. Comput. Sci., 349(1):31--39, 2005.]] Google ScholarDigital Library
- Andrei A. Bulatov, Andrei A. Krokhin, and Peter Jeavons. Constraint satisfaction problems and finite algebras. In Automata, languages and programming (Geneva, 2000), volume 1853 of Lecture Notes in Comput. Sci., pages 272--282. Springer, Berlin, 2000.]] Google ScholarDigital Library
- Stanley Burris and H. P. Sankappanavar. A course in universal algebra, volume 78 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1981.]]Google ScholarCross Ref
- Tomás Feder. Classification of homomorphisms to oriented cycles and of k-partite satisfiability. SIAM J. Discrete Math., 14(4):471--480 (electronic), 2001.]] Google ScholarDigital Library
- Tomás Feder and Moshe Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput., 28(1):57--104 (electronic), 1999.]] Google ScholarDigital Library
- Wolfgang Gutjahr, Emo Welzl, and Gerhard Woeginger. Polynomial graph-colorings. Discrete Appl. Math., 35(1):29--45, 1992.]] Google ScholarDigital Library
- P. Hell, J. Nevril, and X. Zhu. Complexity of tree homomorphisms. Discrete Appl. Math., 70(1):23--36, 1996.]] Google ScholarDigital Library
- P. Hell, J. Nevril, and X. Zhu. Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc., 348(4):1281--1297, 1996.]]Google ScholarCross Ref
- P. Hell, J. Nevsetvril, and X. Zhu. Duality of graph homomorphisms. In Combinatorics, Paul Erd\H os is eighty, Vol. 2 (Keszthely, 1993), volume 2 of Bolyai Soc. Math. Stud., pages 271--282. János Bolyai Math. Soc., Budapest, 1996.]]Google Scholar
- Pavol Hell and Jaroslav Ne\vset\vril. On the complexity of $H$-coloring. J. Combin. Theory Ser. B, 48(1):92--110, 1990.]] Google ScholarDigital Library
- Pavol Hell and Jaroslav Ne\vset\vril. Graphs and homomorphisms, volume 28 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, 2004.]]Google ScholarCross Ref
- Pavol Hell, Hui Shan Zhou, and Xuding Zhu. Homomorphisms to oriented cycles. Combinatorica, 13(4):421--433, 1993.]]Google ScholarCross Ref
- David Hobby and Ralph McKenzie. The structure of finite algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1988.]]Google ScholarCross Ref
- Peter Jeavons, David Cohen, and Marc Gyssens. Closure properties of constraints. J. ACM, 44(4):527--548, 1997.]] Google ScholarDigital Library
- Benoit Larose and László Zádori. The complexity of the extendibility problem for finite posets. SIAM J. Discrete Math., 17(1):114--121 (electronic), 2003.]] Google ScholarDigital Library
- Benoit Larose and László Zádori. Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras. Internat. J. Algebra Comput., 16(3):563--581, 2006.]]Google ScholarCross Ref
- Gary MacGillivray. On the complexity of colouring by vertex-transitive and arc-transitive digraphs. SIAM J. Discrete Math., 4(3):397--408, 1991.]]Google ScholarCross Ref
- Miklós Maróti and Ralph McKenzie. Existence theorems for weakly symmetric operations. Algebra Universalis (accepted), 2007.]]Google Scholar
- Ralph N. McKenzie, George F. McNulty, and Walter F. Taylor. Algebras, lattices, varieties. Vol. I. The Wadsworth & Brooks/Cole Mathematics Series. Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA, 1987.]]Google Scholar
- Ugo Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Sci., 7:95--132, 1974.]]Google ScholarCross Ref
- Thomas J. Schaefer. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pages 216--226. ACM, New York, 1978.]] Google ScholarDigital Library
- Walter Taylor. Varieties obeying homotopy laws. Canad. J. Math., 29(3):498--527, 1977.]]Google ScholarCross Ref
- Xuding Zhu. A polynomial algorithm for homomorphisms to oriented cycles. J. Algorithms, 19(3):333--345, 1995.]] Google ScholarDigital Library
Index Terms
- Graphs, polymorphisms and the complexity of homomorphism problems
Recommendations
Classifying the Complexity of Constraints Using Finite Algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that ...
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
AbstractWe study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from an edge-coloured graph G to an edge-coloured graph H is a vertex-mapping from G to H that ...
Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs
Graph-Theoretic Concepts in Computer ScienceAbstractWe consider the complexity of finding weighted homomorphisms from intersection graphs of curves (string graphs) with n vertices to a fixed graph H. We provide a complete dichotomy for the problem: if H has no two vertices sharing two common ...
Comments