Constraint satisfaction problems for reducts of homogeneous graphs

Bodirsky, Manuel, Martin, Barnaby, Pinsker, Michael and Pongrácz, András (2016) Constraint satisfaction problems for reducts of homogeneous graphs. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016).. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 12-15 Jul 2016, Rome, Italy. ISBN 9783959770132. ISSN 1868-8969 [Conference or Workshop Item] (doi:10.4230/LIPIcs.ICALP.2016.119)

Preview

PDF - Published version (with publisher's formatting) Available under License Creative Commons Attribution 4.0. Download (454kB) | Preview

Abstract

For n >= 3, let (Hn, E) denote the n-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on n vertices. We show that for all structures Gamma with domain Hn whose relations are first-order definable in (Hn, E) the constraint satisfaction problem for Gamma is either in P or is NP-complete. We moreover show a similar complexity dichotomy for all structures whose relations are first-order definable in a homogeneous graph whose reflexive closure is an equivalence relation. Together with earlier results, in particular for the random graph, this completes the complexity classification of constraint satisfaction problems of structures first-order definable in countably infinite homogeneous graphs: all such problems are either in P or NP-complete.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

141Downloads

6 month trend

267Hits

Additional statistics are available via IRStats2.