e/Rado graph

Information
has gloss	eng: In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G and any vertex v of G, any embedding of G − v as an induced subgraph of R can be extended to an embedding of G into R. As a result, the Rado graph contains all finite and countably infinite graphs as induced subgraphs.
lexicalization	eng: Rado graph
instance of	(noun) a visual representation of the relations between certain quantities plotted with reference to a set of axes graph, graphical record

Media
media:img	Rado graph.svg