Duality theorems for finite structures (characterising gaps and good characterisations)
From MaRDI portal
Publication:1850486
Recommendations
- A duality theoretic view on limits of finite structures
- scientific article; zbMATH DE number 7471705
- Duality theorems for finite semigroups
- Finite dualities, in particular in full homomorphisms
- On d-finiteness in continuous structures
- Characterizations of dual semigroups
- scientific article; zbMATH DE number 4148426
- Duality and finite spaces
- Duality theorems and topological structures of groups
- Completeness theorems via the double dual functor
Cites work
- scientific article; zbMATH DE number 3650785 (Why is no real title available?)
- scientific article; zbMATH DE number 1889697 (Why is no real title available?)
- Color-families are dense
- Duality and Polynomial Testing of Tree Homomorphisms
- Fractional multiples of graphs and the density of vertex-transitive graphs
- Lattices arising in categorial investigations of Hedetniemi's conjecture
- On classes of relations and graphs determined by subobjects and factorobjects
- On the complexity of H-coloring
- Operations with structures
- Path homomorphisms
- Paths, Trees, and Flowers
- Symmetric graphs and interpretations
- Symmetric relations (undirected graphs) with given semigroups
- The Homomorphism Structure of Classes of Graphs
Cited in
(59)- Density and fractal property of the class of oriented trees
- Ramsey properties of edge-labelled graphs via completions
- Functors on relational structures which admit both left and right adjoints
- On the general coloring problem
- Splittings in varieties of logic
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Dualities and dual pairs in Heyting algebras
- Interleaved adjoints of directed graphs
- No finite-infinite antichain duality in the homomorphism poset of directed graphs
- scientific article; zbMATH DE number 7471705 (Why is no real title available?)
- Embedding dualities for set partitions and for relational structures
- Density via duality.
- Algebra and the complexity of digraph CSPs: a survey
- A surprising permanence of old motivations (a not-so-rigid story)
- On the density of trigraph homomorphisms
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- A dualistic approach to bounding the chromatic number of a graph
- Majority functions on structures with finite duality
- First order properties on nowhere dense structures
- Tension continuous maps -- their structure and applications
- Duality pairs and homomorphisms to oriented and unoriented cycles
- Path homomorphisms, graph colorings, and Boolean matrices
- Fractal property of the graph homomorphism order
- On the restricted homomorphism problem
- CoReS: a tool for computing core graphs via SAT/SMT solvers
- Cuts and bounds
- Gaps in full homomorphism order
- Universal partial order represented by means of oriented trees and other simple graphs
- NP for Combinatorialists
- Chromatic numbers and products
- In praise of homomorphisms
- Graph partitions with prescribed patterns
- Obstructions to locally injective oriented improper colourings
- Many Facets of Dualities
- Connected obstructions to full graph homomorphisms
- Constraint satisfaction, irredundant axiomatisability and continuous colouring
- On tension-continuous mappings
- Dualities in full homomorphisms
- On infinite-finite duality pairs of directed graphs
- Topology of Hom complexes and test graphs for bounding chromatic number
- A new line of attack on the dichotomy conjecture
- Colouring, constraint satisfaction, and complexity
- Regular families of forests, antichains and duality pairs of relational structures
- Majority constraints have bounded pathwidth duality
- Homomorphisms of random paths
- The homomorphism lattice induced by a finite algebra
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\)
- On digraph coloring problems and treewidth duality
- On nowhere dense graphs
- On Finite Maximal Antichains in the Homomorphism Order
- Tree-depth, subgraph coloring and homomorphism bounds
- Dualities for Constraint Satisfaction Problems
- Digraph functors which admit both left and right adjoints
- Oriented expressions of graph properties
- Forbidden lifts (NP and CSP for combinatorialists)
- On the order of countable graphs
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Finite paths are universal
This page was built for publication: Duality theorems for finite structures (characterising gaps and good characterisations)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850486)
