e/Universal graph

Information
has gloss	eng: In mathematics, a universal graph is an infinite graph that contains every finite (or at-most-countable) graph as an induced subgraph. A universal graph of this type was first constructed by R. Rado and is now called the Rado graph or random graph. More recent work
lexicalization	eng: universal graph
instance of	c/Graph families

Meaning
Castilian
has gloss	spa: En teoría de grafos, un grafo universal es un grafo infinito que contiene a todos los grafos finitos (o al menos numerables) como un subgrafo inducido. El primer grafo universal fue construido por R. Rado, actualmente llamado grafo de Rado o grafo aleatorio.
lexicalization	spa: grafo universal