Two monads on the category of graphs
Combinatorics
2019-04-16 v2
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
Cite
@article{arxiv.1706.00081,
title = {Two monads on the category of graphs},
author = {Gejza Jenča},
journal= {arXiv preprint arXiv:1706.00081},
year = {2019}
}
Comments
10 pages, 3 figures