Abstract
AbstractWe 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have