In praise of homomorphisms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 2012128 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
- A Most General Edge Elimination Polynomial
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- A new line of attack on the dichotomy conjecture
- A new proof of the \(H\)-coloring dichotomy
- A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- A survey on Hedetniemi's conjecture
- A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
- Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Automorphism groups and Ramsey properties of sparse graphs
- Chromatic invariants for finite graphs: Theme and polynomial variations
- Closure properties of constraints
- Colouring, constraint satisfaction, and complexity
- Complexity issues on bounded restrictive \(H\)-coloring
- Constraint Satisfaction with Countable Homogeneous Templates
- Constraints, MMSNP and expander relational structures
- Counterexamples to Hedetniemi's conjecture
- Counting graph homomorphisms
- Dualities and dual pairs in Heyting algebras
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Efficient algorithms for counting parameterized list H-colorings
- First-order interpretations of bounded expansion classes
- Forbidden lifts (NP and CSP for combinatorialists)
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Generalized chromatic polynomials
- Graph invariants related to statistical mechanical models: Examples and problems
- Graph products, Fourier analysis and spectral techniques
- Hedetniemi's conjecture is asymptotically false
- Hedetniemi's conjecture---a survey
- Homomorphism preservation theorems
- Large networks and graph limits
- Matroid invariants and counting graph homomorphisms
- Networks of constraints: Fundamental properties and applications to picture processing
- Note on projective graphs
- On classes of relations and graphs determined by subobjects and factorobjects
- On colorings of graphs without short cycles
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture
- On sparse graphs with given colorings and homomorphisms.
- On the algebraic structure of combinatorial problems
- On the arc-chromatic number of a digraph
- On the complexity of H-coloring
- Operations with structures
- Polynomial graph invariants from homomorphism numbers
- Projectivity and independent sets in powers of graphs
- Regular families of forests, antichains and duality pairs of relational structures
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
- Strongly polynomial sequences as interpretations
- Structural sparsity
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The fractional version of Hedetniemi's conjecture is true
- The restrictive \(H\)-coloring problem
- Theory of relations. Transl. from the French by P. Clote
- H-coloring dichotomy revisited
This page was built for publication: In praise of homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826325)
