For a fixed countable homogeneous relational structure $\Gamma$ we study the computational problem whether a given finite structure of the same signature homomorphically maps to $\Gamma$.
For a fixed countable homogeneous relational structure $\Gamma$ we study the computational problem whether a given finite structure of the same signature homomorphically maps to $\Gamma$. (en)
Pro pevnou spočetnou homogenní relační strukturu $\Gamma$ studujeme problém, zda lze danou konečnou strukturu stejné signatury homomorficky zobrazit do $\Gamma$. (cs)