{
  "aliases": [
    "chordless-cycle",
    "graph-antihole",
    "graph-hole",
    "hole-graph-theory",
    "induced-cycle"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn the mathematical area of graph theory, an **induced path** in an undirected graph $G$ is a [[path|03NAMV1DHJ]] that is an [[induced subgraph|0EREPBVG2G]] of $G$. That is, it is a sequence of vertices in $G$ such that each two adjacent vertices in the sequence are connected by an edge in $G$, and each two nonadjacent vertices in the sequence are not connected by any edge in $G$. An induced path is sometimes called a **snake**, and the problem of finding long induced paths in hypercube graphs is known as the snake-in-the-box problem.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "chordless-cycle",
      "graph-antihole",
      "graph-hole",
      "hole-graph-theory",
      "induced-cycle"
    ],
    "inventory": [
      "VEPZ6T1PTW"
    ],
    "kind": "concept",
    "name": "Induced path",
    "same_as": {
      "wikidata": "Q15704639",
      "wikipedia": "Induced path"
    },
    "sources": [
      {
        "locator": "Induced path",
        "mention": "wikipedia://en/7714430",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:7714430@r1335627072"
      }
    ],
    "tag": "1FP5BQ1E6M"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/1FP5BQ1E6M/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/1FP5BQ1E6M.md",
  "msc": null,
  "name": "Induced path",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/1FP/1FP5BQ1E6M.md",
  "status": null,
  "tag": "1FP5BQ1E6M",
  "uri": "m2://1FP5BQ1E6M",
  "url": "https://math2.tamnd.com/wiki/induced-path/",
  "writing": {
    "tag": "1FP5BQ1E6M",
    "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
      }
    ]
  }
}