In praise of homomorphisms (Q826325)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	In praise of homomorphisms	scientific article

Statements

scholarly article

0 references

In praise of homomorphisms (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.cosrev.2020.100352

0 references

Computer Science Review

0 references

publication date

20 December 2021

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Jaroslav Nešetřil

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cosrev.2020.100352

0 references

0 references

0 references

Theory of relations. Transl. from the French by P. Clote

0 references

0 references

0 references

0 references

Structural sparsity

0 references

Automorphism groups and Ramsey properties of sparse graphs

0 references

All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

0 references

Homomorphism preservation theorems

0 references

Operations with structures

0 references

0 references

Matroid invariants and counting graph homomorphisms

0 references

Chromatic invariants for finite graphs: Theme and polynomial variations

0 references

Graph invariants related to statistical mechanical models: Examples and problems

0 references

Generalized chromatic polynomials

0 references

A Most General Edge Elimination Polynomial

0 references

Polynomial graph invariants from homomorphism numbers

0 references

From a zoo to a zoology: Towards a general theory of graph polynomials

0 references

Strongly polynomial sequences as interpretations

0 references

0 references

On classes of relations and graphs determined by subobjects and factorobjects

0 references

Networks of constraints: Fundamental properties and applications to picture processing

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

Counterexamples to Hedetniemi's conjecture

0 references

A survey on Hedetniemi's conjecture

0 references

Hedetniemi's conjecture---a survey

0 references

On inverse powers of graphs and topological implications of Hedetniemi's conjecture

0 references

A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function

0 references

Hedetniemi's conjecture is asymptotically false

0 references

The fractional version of Hedetniemi's conjecture is true

0 references

On the arc-chromatic number of a digraph

0 references

Dualities and dual pairs in Heyting algebras

0 references

Duality theorems for finite structures (characterising gaps and good characterisations)

0 references

Regular families of forests, antichains and duality pairs of relational structures

0 references

Forbidden lifts (NP and CSP for combinatorialists)

0 references

Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality

0 references

A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.

0 references

Graph products, Fourier analysis and spectral techniques

0 references

Note on projective graphs

0 references

Projectivity and independent sets in powers of graphs

0 references

On colorings of graphs without short cycles

0 references

On sparse graphs with given colorings and homomorphisms.

0 references

Constraints, MMSNP and expander relational structures

0 references

Efficient algorithms for counting parameterized list \(H\)-colorings

0 references

Complexity issues on bounded restrictive \(H\)-coloring

0 references

The restrictive \(H\)-coloring problem

0 references

On the complexity of H-coloring

0 references

Colouring, constraint satisfaction, and complexity

0 references

Constraint Satisfaction with Countable Homogeneous Templates

0 references

Closure properties of constraints

0 references

On the algebraic structure of combinatorial problems

0 references

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem

0 references

\(H\)-coloring dichotomy revisited

0 references

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP

0 references

A new line of attack on the dichotomy conjecture

0 references

A combinatorial constraint satisfaction problem dichotomy classification conjecture

0 references

A New Proof of the <i>H</i>-Coloring Dichotomy

0 references

A strong Mal'cev condition for locally finite varieties omitting the unary type

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:826325

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q826325&oldid=36752251"