Consider the following generalized graph-minor theorem:
GM($κ,λ$): Given any collection $S$ of $κ$ simple undirected graphs each with less than $λ$ vertices, there are distinct graphs $G,H$ in $S$ such that $G$ embeds as a minor into $H$.
Then the Robertson-Seymour theorem is GM($\aleph_0,\aleph_0$). Vopěnka's principle is said to imply GM(∞,∞) where "∞" here denotes "proper class sized". I was hence wondering what is known about other cardinals $κ,λ$. It is obvious that GM($κ,λ$) is true if $κ > \sup_{μ<λ} 2^μ$. And this post states that GM($2^{\aleph_0},(2^{\aleph_0})^+$) is false. So my questions are:
What is known about the minimum $κ$ in terms of $λ$ such that GM($κ,λ$) is true? In particular, I am most curious about $λ = \aleph_1$, and I guess GM($\aleph_0,\aleph_1$) is false while GM($\aleph_1,\aleph_1$) is true.
Is GM($κ,κ$) known to be true or false for any particular $κ > \aleph_0$? Does Vopěnka's principle make a difference?
[Note: I edited to fix an error that was pointed out in the comments.]