A coalgebraic model of graphs
Abstract
For a set-endofunctor F, a graph is triple (V,E,g) with a structure map g:E→ F V. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over Set× Set and use the theory of coalgebras over arbitrary categories to conclude properties of the category of graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.