All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Dualities in full homomorphisms

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206371" target="_blank" >RIV/00216208:11320/09:00206371 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216208:11320/10:10081043

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Dualities in full homomorphisms

  • Original language description

    The Constraint Satisfaction Problem (CSP) is studied for constraints given as requirements in full graph homomorphisms. It is proved that for every finite (full) system of constraints there exists a finite duality, that is, a finite system of prohibitedsources, or subobjects, equivalent with the constraint task. The converse, however does not hold, in fact it is, rather, rare - it is a phenomenon of the Ramsey type. As an illustration we present a number of concrete finite dualities, and of the associated Ramsey phenomena.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2010

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    European Journal of Combinatorics

  • ISSN

    0195-6698

  • e-ISSN

  • Volume of the periodical

    31

  • Issue of the periodical within the volume

    31

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    124

  • Pages from-to

  • UT code for WoS article

    000271971000011

  • EID of the result in the Scopus database