Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
From MaRDI portal
Publication:5470800
DOI10.1137/S0895480104445630zbMath1105.05025OpenAlexW2001521450MaRDI QIDQ5470800
Claude Tardif, Jaroslav Nešetřil
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480104445630
Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Algebraic combinatorics (05E99) Coloring of graphs and hypergraphs (05C15) Model theory of finite structures (03C13)
Related Items
In praise of homomorphisms ⋮ Dualities and dual pairs in Heyting algebras ⋮ Generalised dualities and maximal finite antichains in the homomorphism order of relational structures ⋮ Majority functions on structures with finite duality ⋮ Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities ⋮ Many Facets of Dualities ⋮ NU Polymorphisms on Reflexive Digraphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Regular families of forests, antichains and duality pairs of relational structures ⋮ Homomorphisms of random paths ⋮ First order properties on nowhere dense structures ⋮ Graph partitions with prescribed patterns ⋮ Connected obstructions to full graph homomorphisms ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles ⋮ Dualities in full homomorphisms ⋮ Dualities for Constraint Satisfaction Problems
