{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "2KM46K20DZ"
    }
  ],
  "body": "\n## Summary\n\nA hypergraph is a generalisation of a [[graph|00C0BR7D7H]] in which an edge may join any number of vertices.\nFormally it is a set of vertices together with a family of subsets of it, the hyperedges.\nHypergraphs are the natural language for set systems, [[block designs|4JCSS2Z1BA]] and many problems of extremal combinatorics.\nThe node [[hypergraph|2KM46K20DZ]] gives the precise definition.\n\n## Explanations\n\n### L1 human\n\nIn a graph, an edge links two people, like a friendship.\nIn a hypergraph, an edge can be a whole club with any number of members.\nFor example, the students of a school are the vertices and each class is a hyperedge.\nWhen every hyperedge has exactly two members, a hypergraph is just a graph.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C65"
    ],
    "name": "Hypergraph",
    "same_as": {
      "wikidata": "Q840247",
      "wikipedia": "Hypergraph"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Hypergraph"
      }
    ],
    "tag": "CH2JRZNX7V"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/CH2JRZNX7V/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/CH2JRZNX7V.md",
  "msc": [
    "05C65"
  ],
  "name": "Hypergraph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/CH2/CH2JRZNX7V.md",
  "status": null,
  "tag": "CH2JRZNX7V",
  "uri": "m2://CH2JRZNX7V",
  "url": "https://math2.tamnd.com/wiki/hypergraph/",
  "writing": {
    "tag": "CH2JRZNX7V",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}