Almost all graphs are vertex-minor universal

Ruben Ascoli, Bryce Frederickson, Sarah Frederickson +2

Answering a question of Claudet, we prove that the uniformly random graph $G\sim \mathbb{G}(n,1/2)$ is $\Omega (\sqrt{n})$-vertex-minor universal with high probability. That is, for some…