Combinatorial examples in universal coalgebra
HTML articles powered by AMS MathViewer
- by Robert C. Davis PDF
- Proc. Amer. Math. Soc. 89 (1983), 32-34 Request permission
Abstract:
If an underlying-set functor different from the usual one is employed, the categories of multigraphs and of combinatorial systems become cotripleable over the category of sets. The category of multigraphs without loops and a common generalization are also examined.References
- Robert C. Davis, Quasi-cotripleable categories, Proc. Amer. Math. Soc. 35 (1972), 43–48. MR 316531, DOI 10.1090/S0002-9939-1972-0316531-1
- Jack E. Graver and Mark E. Watkins, Combinatorics with emphasis on the theory of graphs, Graduate Texts in Mathematics, Vol. 54, Springer-Verlag, New York-Berlin, 1977. MR 0505525
Additional Information
- © Copyright 1983 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 89 (1983), 32-34
- MSC: Primary 18C15; Secondary 05C99, 08C05
- DOI: https://doi.org/10.1090/S0002-9939-1983-0706504-6
- MathSciNet review: 706504