The Rado graph is the Fraïssé limit of the finite graphs. Its defining property: for any two disjoint finite sets U and V of vertices, some vertex outside U ∪ V is adjacent to every vertex of U and to no vertex of V. Click the vertices below to put them in U (pink), in V (purple) or in neither, and the page finds such a vertex.