{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn the context of the reconstruction conjecture, a graph property is recognizable if its truth can be determined from the deck of the graph. Many graph properties are known to be recognizable. If the reconstruction conjecture is true, all graph properties are recognizable.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "T3Q3JEE7W7"
    ],
    "kind": "concept",
    "name": "Recognizable",
    "sources": [
      {
        "locator": "Glossary of graph theory, section R",
        "mention": "wikipedia://en/325802#BISW",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "Y08A0V51VC"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/Y08A0V51VC/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/Y08A0V51VC.md",
  "msc": null,
  "name": "Recognizable",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/Y08/Y08A0V51VC.md",
  "status": null,
  "tag": "Y08A0V51VC",
  "uri": "m2://Y08A0V51VC",
  "url": "https://math2.tamnd.com/wiki/recognizable/",
  "writing": {
    "tag": "Y08A0V51VC",
    "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
      }
    ]
  }
}