Add to ORKGAbstract. We describe a concrete construction of all pushout complements for two given morphisms f : A → B, m : B → D in the category of hypergraphs, valid also for the case where f, m are non-injective. To our knowledge such a construction has not been discussed before in the literature. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show how well-known coefficients from combinatorics, such as the Bell numbers, can be recovered
In the paper algorithms are given that find a minimal transversal and all minimal transversals, resp...
We study the existence of a push-out for two morphisms $Z \to X$ and $Z \to Y$ in the category of sc...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...
Abstract: We describe a concrete construction of all pushout complements for two given morphisms f: ...
We describe a concrete construction of all pushout complements for two given morphisms f : A -> B, m...
AbstractIn category theory, most set-theoretic constructions–union, intersection, etc.–have direct c...
AbstractIn this paper we study single-pushout transformation in a category of spans, a generalizatio...
Single-pushout transformation in a category of spans, in some sense a generalization of the usual no...
AbstractAn existence theorem of pushout-complements is given in an elementary topos by using categor...
Different relationships between single-pushout rewriting of total and partial unary algebras are stu...
AbstractParallel and distributed derivations are introduced and studied in the single-pushout approa...
In this paper we investigate and compare four variants of the double-pushout approach to graph trans...
AbstractThe transformation of total graph structures has been studied from the algebraic point of vi...
A unifying view of all constructions of pushouts of partial morphisms considered so far in the lite...
The elegance of the single-pushout (SPO) approach to graph transformations arises from substituting ...
In the paper algorithms are given that find a minimal transversal and all minimal transversals, resp...
We study the existence of a push-out for two morphisms $Z \to X$ and $Z \to Y$ in the category of sc...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...
Abstract: We describe a concrete construction of all pushout complements for two given morphisms f: ...
We describe a concrete construction of all pushout complements for two given morphisms f : A -> B, m...
AbstractIn category theory, most set-theoretic constructions–union, intersection, etc.–have direct c...
AbstractIn this paper we study single-pushout transformation in a category of spans, a generalizatio...
Single-pushout transformation in a category of spans, in some sense a generalization of the usual no...
AbstractAn existence theorem of pushout-complements is given in an elementary topos by using categor...
Different relationships between single-pushout rewriting of total and partial unary algebras are stu...
AbstractParallel and distributed derivations are introduced and studied in the single-pushout approa...
In this paper we investigate and compare four variants of the double-pushout approach to graph trans...
AbstractThe transformation of total graph structures has been studied from the algebraic point of vi...
A unifying view of all constructions of pushouts of partial morphisms considered so far in the lite...
The elegance of the single-pushout (SPO) approach to graph transformations arises from substituting ...
In the paper algorithms are given that find a minimal transversal and all minimal transversals, resp...
We study the existence of a push-out for two morphisms $Z \to X$ and $Z \to Y$ in the category of sc...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...