You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Just a quick check: is the category of graphs and graph homomorphisms monoidal closed?
This topic was moved here from #general > bicompletions by Nathanael Arkor
You need to specify what you mean by "graph", since there are multiple possible definitions (e.g. undirected/directed, single/multiple edges, loops or not, etc.).
For undirected graphs without multiple edges or loops, the tensor product of graphs is the cartesian product, which has a right adjoint given by the construction of exponential graphs.
There are tons of categories of graphs, each with tons of monoidal structures. In fact there's a Wikipedia page that seems to list 10 monoidal structures on the category of simple graphs:
though I haven't checked that they're all monoidal structures, and the last one could easily not be.
If we take graph to mean quiver, which is what category theorists usually do, then the category of graphs is a presheaf category, hence a topos, hence cartesian closed.
The quiver link seems to be the graph product link.
Whoops. I meant Wikipedia article
Quiver (mathematics)
Fixed.
Ronnie Brown et al describe several different monoidal closed categories of graphs:
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1a1/pdf
While there are tons of monoidal structures on graphs, I don't think many of them give rise to closed categories.
Since people know all the symmetric monoidal closed structures on the category Cat (there are just two, up to isomorphism) maybe they know them all - or someone can figure out all of them - on the category Graph. (Let's take this to be the category theorist's favorite category of graphs: the category of quivers.)