Hello, I'm writting something about Malcev categories and monadicity. The fact is that I need to know if Graph is or not complete (have all finite limits). It seems easy but I would like a real answer (not my feelings saying that it is) and I don't find that information anywhere.


Thank you for your answers.



Category of graphs.
First let me just mention that *complete* usually means "has all small limits". If you want to say "has all finite limits", you could use the term *finitely complete* or just *has finite limits*.


You did not explain which particular category of graphs you are talking about, but luckily almost any reasonable choice will have an affirmative answer: yes, the category of graphs has finite limits. I can tell you why if you tell me what objects and morphisms you have in mind.


