[FOM] Graphs vs. Ord

[pax0 at seznam.cz]

Hi All,
what is the logical relationship between these two hypotheses:
[A] Ordinals (considered as a thin category) cannot be fully embedded into 
the category of Graphs.
(unordered, without loops, with morphisms graph homomorphisms)
[B] The dual of Ordinals is such.
And yet, what is the approximate set theoretic strength of these two claims?
Thank you, Jan Pax

-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20130326/0e62aa7c/attachment.html>