There is no universal countable random-free graph

We consider embeddings between infinite graphs. In particular, we establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.