Timeline for Realizing a monoid as $\mathrm{End}(G)$ for some graph $G$
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2019 at 11:16 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
added link to the paper
|
| Nov 27, 2014 at 22:14 | comment | added | Emil Jeřábek | If the category-theoretic setting is any similar to the many other contexts where the encode-arbitrary-structures-as-graphs idea occurs, I would expect that you can do the same with simple undirected graphs. By transitivity, it would be enough to show that the category of directed graphs fully embeds into the category of undirected graphs. | |
| Nov 27, 2014 at 18:32 | comment | added | Tom Leinster | To add some info on Adam's remarks: for Adámek and Rosický, a graph is a set endowed with a binary relation and a homomorphism is a function preserving the binary relation. More concretely put, their graphs are directed, can have loops but cannot have multiple edges, and may be infinite. They give that definition on p.10. The section on embedding into graphs, which presumably contains the results Adam mentions, is section 2.G. | |
| Nov 27, 2014 at 14:17 | comment | added | Dominic van der Zypen | That's fantastic Adam - thanks for your general remarks! | |
| Nov 27, 2014 at 13:55 | history | answered | Adam Przeździecki | CC BY-SA 3.0 |