{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nA sparse graph is one that has few edges relative to its number of vertices. In some definitions the same property should also be true for all subgraphs of the given graph.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "9R13ZFS4DJ"
    ],
    "kind": "concept",
    "name": "Sparse",
    "sources": [
      {
        "locator": "Glossary of graph theory, section S",
        "mention": "wikipedia://en/325802#HVTF",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "7D07N8YDZ2"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/7D07N8YDZ2/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/7D07N8YDZ2.md",
  "msc": null,
  "name": "Sparse",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/7D0/7D07N8YDZ2.md",
  "status": null,
  "tag": "7D07N8YDZ2",
  "uri": "m2://7D07N8YDZ2",
  "url": "https://math2.tamnd.com/wiki/sparse/",
  "writing": {
    "tag": "7D07N8YDZ2",
    "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
      }
    ]
  }
}