Two monads on the category of graphs

DOI10.1515/MS-2017-0220MaRDI QIDQ5228768zbMATHOpenAlexFDO

Authors Gejza Jenča

Publication date 12 August 2019

Published in Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.00081

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Steiner systems in finite geometry (51E10)

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.

This page was built for publication: Two monads on the category of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228768)