There is no universal countable random-free graph
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.