Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials

Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Topoi (18B25) Graph theory (including graph drawing) in computer science (68R10)

Abstract: This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective objects, unlike the category of directed multigraphs (i.e. quivers). The category of incidence hypergraphs is introduced as a "graph-like" remedy for the set-system issues so that hypergraphs may be studied by their locally graphic behavior via homomorphisms that allow an edge of the domain to be mapped into a subset of an edge in the codomain. Moreover, it is shown that the category of quivers embeds into the category of incidence hypergraphs via a logical functor that is the inverse image of an essential geometric morphism between the topoi. Consequently, the quiver exponential is shown to be simply represented using incidence hypergraph homomorphisms.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116558)