Dualities and dual pairs in Heyting algebras

DOI10.1007/s11083-010-9163-3zbMath1206.06004arXiv0908.0428OpenAlexW2005947941MaRDI QIDQ603889

Jaroslav Nešetřil, Claude Tardif, Jan Foniok, Ales Pultr

Publication date: 8 November 2010

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.0428

zbMATH Keywords

homomorphismsfinite dualitygood characterizationstructural theorems in combinatorics

Mathematics Subject Classification ID

Heyting algebras (lattice-theoretic aspects) (06D20) Preorders, orders, domains and lattices (viewed as categories) (18B35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

In praise of homomorphisms ⋮ On the General Coloring Problem

Cites Work

• The core of a graph
• A hypergraph-free construction of highly chromatic graphs without short cycles
• Consistency in networks of relations
• On classes of relations and graphs determined by subobjects and factorobjects
• On colorings of graphs without short cycles
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Splitting property in infinite posets
• On sparse graphs with given colorings and homomorphisms.
• Networks of constraints: Fundamental properties and applications to picture processing
• Duality theorems for finite structures (characterising gaps and good characterisations)
• A splitting property of maximal antichains
• On digraph coloring problems and treewidth duality
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• Constraints, MMSNP and expander relational structures
• How to split antichains in infinite posets
• Graph Theory and Probability
• Applications of product colouring
• Uniquely Colourable Graphs with Large Girth
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Duality and Polynomial Testing of Tree Homomorphisms
• A Characterisation of First-Order Constraint Satisfaction Problems
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item