I'm trying to understand Vopěnka's Principle, which is a large cardinal axiom. One version of the principle is that there does not exist a proper class of directed graphs such that there are no homomorphisms between any two graphs in the class. This is a large cardinal axiom because it implies the existence of a proper class of measurable cardinals. If Vopěnka's principle is true, then it is not provable in ZFC, since it implies the consistency of ZFC. (It's falsity may be provable in ZFC.)

I presume that since it functions as a large cardinal axiom, then it must fail at small cardinals (i.e. cardinals whose existence is provable within ZFC, such as $\aleph_\omega$). Is there an explicit construction for any such cardinal $\kappa$ there exists a set of graphs of size $\kappa$ such that Vopěnka's Principle fails for that set? In other words, there are no two homomorphisms between the two graphs in that set?

I can come up with a construction for $\aleph_0$, but that's it. (For $\aleph_0$, the set of directed cycle graphs with a prime number of vertices does the trick, I think.)