This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n11http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F10%3A10081043%21RIV11-MSM-11320___/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10081043%21RIV11-MSM-11320___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-edge-preserving. The research was motivated, a.o., by results from logic (concerning first order definability) and Constraint Satisfaction Problems. We prove that for any finite set of objects B (finite relational Structures) there is a finite duality with B to the left. It appears that the surprising richness of these dualities leads to interesting problems of Ramsey type: this is what we explicitly analyze in the simplest case of graphs. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-edge-preserving. The research was motivated, a.o., by results from logic (concerning first order definability) and Constraint Satisfaction Problems. We prove that for any finite set of objects B (finite relational Structures) there is a finite duality with B to the left. It appears that the surprising richness of these dualities leads to interesting problems of Ramsey type: this is what we explicitly analyze in the simplest case of graphs.
dcterms:title
Dualities in full homomorphisms Dualities in full homomorphisms
skos:prefLabel
Dualities in full homomorphisms Dualities in full homomorphisms
skos:notation
RIV/00216208:11320/10:10081043!RIV11-MSM-11320___
n3:aktivita
n9:Z n9:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:cisloPeriodika
1
n3:dodaniDat
n8:2011
n3:domaciTvurceVysledku
n4:1111116 n4:8626006
n3:druhVysledku
n14:J
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
255337
n3:idVysledku
RIV/00216208:11320/10:10081043
n3:jazykVysledku
n18:eng
n3:klicovaSlova
graphs; homomorphism; Duality
n3:klicoveSlovo
n7:homomorphism n7:Duality n7:graphs
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[17386822B262]
n3:nazevZdroje
European Journal of Combinatorics
n3:obor
n13:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n19:1M0545
n3:rokUplatneniVysledku
n8:2010
n3:svazekPeriodika
31
n3:tvurceVysledku
Ball, Richard N. Nešetřil, Jaroslav Pultr, Aleš
n3:wos
000271971000011
n3:zamer
n16:MSM0021620838
s:issn
0195-6698
s:numberOfPages
14
n11:organizacniJednotka
11320