Let K be a class of finite graphs and F = {F1, F2, ..., Fm} be a set of finite graphs. Then, K is said to have finite-duality if there exists a graph U in K such that for any graph G in K, G is homomorphic to U if and only if Fi is not homomorphic to G, for all i = 1, 2, ..., m. Nešetřil asked in [J. Nešetřil, Homonolo Combinatorics Workshop, Nova Louka, Czech Rep., (2003)] if non-trivial examples can be found. In this note, we answer this positively by showing classes containing arbitrary long anti-chains and yet having the finite-duality property
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
Let K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set of graph...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...
Abstract. This paper is a survey of several results concerning finite dualities, a special case of t...
The (A,D) duality pairs play a crucial role in the theory of general relational struc-tures and in C...
Abstract. This paper is a survey of several results concerning finite dualities, a special case of t...
Abstract. This paper is a survey of several results concerning finite dualities, a special case of t...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
We investigate classes of graphs and posets that admit decompositions to obtain or disprove finitene...
Article dans revue scientifique avec comité de lecture.We investigate classes of graphs and posets t...
AbstractWe provide a correspondence between the subjects of duality and density in classes of finite...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
Let K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set of graph...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...
Abstract. This paper is a survey of several results concerning finite dualities, a special case of t...
The (A,D) duality pairs play a crucial role in the theory of general relational struc-tures and in C...
Abstract. This paper is a survey of several results concerning finite dualities, a special case of t...
Abstract. This paper is a survey of several results concerning finite dualities, a special case of t...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
We investigate classes of graphs and posets that admit decompositions to obtain or disprove finitene...
Article dans revue scientifique avec comité de lecture.We investigate classes of graphs and posets t...
AbstractWe provide a correspondence between the subjects of duality and density in classes of finite...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cu...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...