{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, a **universal graph** is an infinite [[graph|00C0BR7D7H]] 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 graphs for a graph family $F$: that is, an infinite graph belonging to $F$ that contains all finite graphs in $F$. For instance, the Henson graphs are universal in this sense for the $i$-clique-free graphs.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "MKPFQFTWB3"
    ],
    "kind": "concept",
    "name": "Universal graph",
    "same_as": {
      "wikidata": "Q7894131",
      "wikipedia": "Universal graph"
    },
    "sources": [
      {
        "locator": "Universal graph",
        "mention": "wikipedia://en/1452141",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:1452141@r1368641504"
      }
    ],
    "tag": "4S189K88T3"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/4S189K88T3/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/4S189K88T3.md",
  "msc": null,
  "name": "Universal graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/4S1/4S189K88T3.md",
  "status": null,
  "tag": "4S189K88T3",
  "uri": "m2://4S189K88T3",
  "url": "https://math2.tamnd.com/wiki/universal-graph/",
  "writing": {
    "tag": "4S189K88T3",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}