Duality theorems for finite structures (characterising gaps and good characterisations)
From MaRDI portal
Publication:1850486
DOI10.1006/JCTB.2000.1970zbMATH Open1024.05078OpenAlexW1986537785MaRDI QIDQ1850486FDOQ1850486
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6e4eddf4d6671c37537bb5d1c9623353b62e8531
Combinatorics in computer science (68R05) Structural characterization of families of graphs (05C75) Relational systems, laws of composition (08A02)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- On the complexity of H-coloring
- Color-families are dense
- The Homomorphism Structure of Classes of Graphs
- Symmetric relations (undirected graphs) with given semigroups
- Lattices arising in categorial investigations of Hedetniemi's conjecture
- Symmetric graphs and interpretations
- On classes of relations and graphs determined by subobjects and factorobjects
- Duality and Polynomial Testing of Tree Homomorphisms
- Fractional multiples of graphs and the density of vertex-transitive graphs
- Operations with structures
- Path homomorphisms
Cited In (59)
- Chromatic numbers and products
- In praise of homomorphisms
- Many Facets of Dualities
- On Finite Maximal Antichains in the Homomorphism Order
- Graph partitions with prescribed patterns
- Homomorphisms of random paths
- On nowhere dense graphs
- Density via duality.
- Colouring, constraint satisfaction, and complexity
- Dualities for Constraint Satisfaction Problems
- Splittings in varieties of logic
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\)
- Tension continuous maps -- their structure and applications
- The homomorphism lattice induced by a finite algebra
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Dualities and dual pairs in Heyting algebras
- Algebra and the Complexity of Digraph CSPs: a Survey
- Connected obstructions to full graph homomorphisms
- Oriented expressions of graph properties
- Majority constraints have bounded pathwidth duality
- On the density of trigraph homomorphisms
- Dualities in full homomorphisms
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- First order properties on nowhere dense structures
- A new line of attack on the dichotomy conjecture
- Tree-depth, subgraph coloring and homomorphism bounds
- Path homomorphisms, graph colorings, and boolean matrices
- Cuts and bounds
- Finite paths are universal
- Title not available (Why is that?)
- Digraph functors which admit both left and right adjoints
- On the order of countable graphs
- Specifying graph languages with type graphs
- Obstructions to locally injective oriented improper colourings
- On tension-continuous mappings
- A surprising permanence of old motivations (a not-so-rigid story)
- CoReS: a tool for computing core graphs via SAT/SMT solvers
- NP for Combinatorialists
- Interleaved adjoints of directed graphs
- Fractal property of the graph homomorphism order
- Duality pairs and homomorphisms to oriented and unoriented cycles
- Gaps in full homomorphism order
- Constraint satisfaction, irredundant axiomatisability and continuous colouring
- Universal partial order represented by means of oriented trees and other simple graphs
- On infinite-finite duality pairs of directed graphs
- On digraph coloring problems and treewidth duality
- Forbidden lifts (NP and CSP for combinatorialists)
- No finite-infinite antichain duality in the homomorphism poset of directed graphs
- A dualistic approach to bounding the chromatic number of a graph
- On the restricted homomorphism problem
- Topology of Hom complexes and test graphs for bounding chromatic number
- Regular families of forests, antichains and duality pairs of relational structures
- Title not available (Why is that?)
- Majority functions on structures with finite duality
- Functors on relational structures which admit both left and right adjoints
- Density and fractal property of the class of oriented trees
- Ramsey properties of edge-labelled graphs via completions
- On the General Coloring Problem
Recommendations
- A duality theoretic view on limits of finite structures π π
- Title not available (Why is that?) π π
- Duality theorems for finite semigroups π π
- Title not available (Why is that?) π π
- On d-finiteness in continuous structures π π
- Characterizations of dual semigroups π π
- Title not available (Why is that?) π π
- Duality and finite spaces π π
- Duality theorems and topological structures of groups π π
- Completeness theorems via the double dual functor π π
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)
