Name
Abstract | ||
|---|---|---|
For n u003e= 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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1137/16m1082974 | international colloquium on automata languages and programming |
Field | DocType | Volume |
Discrete mathematics,Graph,Complete graph,Combinatorics,Countable set,Homogeneous,Constraint satisfaction problem,Universal algebra,Mathematics,Computational complexity theory | Journal | 48 |
Issue | Citations | PageRank |
4 | 2 | 0.38 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Bodirsky | 1 | 644 | 54.63 |
| Barnaby Martin | 2 | 175 | 31.80 |
| Michael Pinsker | 3 | 132 | 17.54 |
| András Pongrácz | 4 | 17 | 3.90 |