Photo from academic.microsoft.com
Abstract We introduce two monads on the category of graphs and prove that their Eilenberg-Moore categories are isomorphic to the category of perfect matchings and the category of partial Steiner… Click to show full abstract
Abstract We introduce two monads on the category of graphs and prove that their Eilenberg-Moore categories are isomorphic to the category of perfect matchings and the category of partial Steiner triple systems, respectively. As a simple application of these results, we describe the product in the categories of perfect matchings and partial Steiner triple systems.
Keywords:
two monads;
monads category;
category graphs
Journal Title: Mathematica Slovaca
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematica Slovaca
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!