{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nThe multiset of graphs formed from a single graph $G$ by deleting a single vertex in all possible ways, especially in the context of the reconstruction conjecture. An edge-deck is formed in the same way by deleting a single edge in all possible ways. The graphs in a deck are also called *cards*. See also critical (graphs that have a property that is not held by any card) and hypo- (graphs that do not have a property that is held by all cards).\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "Y31JBM9H2V"
    ],
    "kind": "concept",
    "name": "Deck",
    "sources": [
      {
        "locator": "Glossary of graph theory, section D",
        "mention": "wikipedia://en/325802#416L",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "RD7XTY6XS8"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/RD7XTY6XS8/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/RD7XTY6XS8.md",
  "msc": null,
  "name": "Deck",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/RD7/RD7XTY6XS8.md",
  "status": null,
  "tag": "RD7XTY6XS8",
  "uri": "m2://RD7XTY6XS8",
  "url": "https://math2.tamnd.com/wiki/deck/",
  "writing": {
    "tag": "RD7XTY6XS8",
    "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
      }
    ]
  }
}