{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0NNYDD1AVR"
    },
    {
      "field": "uses",
      "target": "0PD57PSHNR"
    }
  ],
  "body": "\n## Definition\n\nLet $G$ be a [[graph|0JD5C82QMB]].\nA trail in $G$ is a [[walk|0VJZM0F9YM]] $(w_0, w_1, \\dots, w_k)$ whose edges $w_0 w_1, w_1 w_2, \\dots, w_{k-1} w_k$ are pairwise distinct.\n\n## Remarks\n\nA trail may visit a vertex more than once, but it uses each edge at most once.\nEvery [[path|0JDE56HWQ8]] is a trail. In the graph of two triangles that share a vertex $c$, the closed walk $a, b, c, d, e, c, a$ is a trail but not a path.\nAn [[Eulerian trail|0NNYDD1AVR]] is a trail that uses every edge.\n\n## Explanations\n\n### L1 human\n\nA trail is a walk that never uses the same edge twice.\nIt is the kind of route that you draw without lifting your pen and without retracing a line.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "0W50MT1C6X",
    "kind": "definition",
    "msc": [
      "05C38"
    ],
    "name": "Trail",
    "sources": [
      {
        "locator": "Walk, trail, and path",
        "url": "https://en.wikipedia.org/wiki/Path_(graph_theory)"
      }
    ],
    "tag": "062MQGP8M5",
    "uses": [
      "0VJZM0F9YM"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/062MQGP8M5/",
  "links": [
    {
      "field": "defines",
      "target": "0W50MT1C6X"
    },
    {
      "field": "uses",
      "target": "0VJZM0F9YM"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/062MQGP8M5.md",
  "msc": [
    "05C38"
  ],
  "name": "Trail",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/062/062MQGP8M5.md",
  "status": null,
  "tag": "062MQGP8M5",
  "uri": "m2://062MQGP8M5",
  "url": "https://math2.tamnd.com/wiki/trail-definition/",
  "writing": {
    "tag": "062MQGP8M5",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}