Misplaced Pages

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Homomorphic equivalence" – news · newspapers · books · scholar · JSTOR (August 2016) (Learn how and when to remove this message)

In graph theory, a branch of mathematics, two graphs G and H are called homomorphically equivalent if there exists a graph homomorphism ${\displaystyle f\colon G\to H}$ and a graph homomorphism ${\displaystyle g\colon H\to G}$. An example usage of this notion is that any two cores of a graph are homomorphically equivalent.

Homomorphic equivalence also comes up in the theory of databases. Given a database schema, two instances I and J on it are called homomorphically equivalent if there exists an instance homomorphism ${\displaystyle f\colon I\to J}$ and an instance homomorphism ${\displaystyle g\colon J\to I}$.

Deciding whether two graphs are homomorphically equivalent is NP-complete.

In fact for any category C, one can define homomorphic equivalence. It is used in the theory of accessible categories, where "weak universality" is the best one can hope for in terms of injectivity classes; see

References

1. Flum, J.; Grohe, M. (2006-05-01). Parameterized Complexity Theory. Springer Science & Business Media. p. 330. ISBN 978-3-540-29953-0.
2. Adamek and Rosicky, "Locally Presentable and Accessible Categories".

This graph theory-related article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Graph theory
• Equivalence (mathematics)
• Graph theory stubs