Two monads on the category of graphs
arXiv:1706.00081 · doi:10.1515/ms-2017-0220
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.
arXiv comment10 pages, 3 figures