Name
Abstract | ||
|---|---|---|
The duality pairs play a crucial role in the theory of general relational structures and in Constraint Satisfaction Problems. The case where both sides are finite is fully characterized. The case where both sides are infinite seems to be very complex. It is also known that no finite–infinite duality pair is possible if we make the additional restriction that both classes are antichains. In this paper (which is the first one of a series) we start the detailed study of the infinite–finite case. Here we concentrate on directed graphs. We prove some elementary properties of the infinite–finite duality pairs, including lower and upper bounds on the size of , and show that the elements of must be equivalent to forests if is an antichain. Then we construct instructive examples, where the elements of are paths or trees. Note that the existence of infinite–finite antichain dualities was not previously known. |
Year | DOI | Venue |
|---|---|---|
2013 | https://doi.org/10.1007/s11083-012-9278-9 | Order |
Keywords | DocType | Volume |
Graph homomorphism,Duality pairs,General relational structures,Constraint satisfaction problem,Regular languages,Nondeterministic finite automaton | Journal | 30 |
Issue | ISSN | Citations |
3 | 0167-8094 | 1 |
PageRank | References | Authors |
0.37 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Péter L. Erdös | 1 | 267 | 46.75 |
| Claude Tardif | 2 | 341 | 38.08 |
| Gábor Tardos | 3 | 1261 | 140.58 |