{"version":"1.0","type":"link","title":"Universal graph - Newikis","description":"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 Richard Rado and is now called the Rado graph or random graph. More recent work has focused on universal…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}