{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nAn odd cycle is a cycle whose length is odd. The odd girth of a non-bipartite graph is the length of its shortest odd cycle. An odd hole is a special case of an odd cycle: one that is induced and has four or more vertices.\n\nAn odd vertex is a vertex whose degree is odd. By the handshaking lemma every finite undirected graph has an even number of odd vertices.\n\nAn odd ear is a simple path or simple cycle with an odd number of edges, used in odd ear decompositions of factor-critical graphs; see ear.\n\nAn odd chord is an edge connecting two vertices that are an odd distance apart in an even cycle. Odd chords are used to define strongly chordal graphs.\n\nAn odd graph is a special case of a Kneser graph, having one vertex for each $(n - 1)$-element subset of a $(2n - 1)$-element set, and an edge connecting two subsets when their corresponding sets are disjoint.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "47CRVYJEQA"
    ],
    "kind": "concept",
    "name": "Odd",
    "sources": [
      {
        "locator": "Glossary of graph theory, section O",
        "mention": "wikipedia://en/325802#IBLS",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "2EF2WBS7SX"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/2EF2WBS7SX/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2EF2WBS7SX.md",
  "msc": null,
  "name": "Odd",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2EF/2EF2WBS7SX.md",
  "status": null,
  "tag": "2EF2WBS7SX",
  "uri": "m2://2EF2WBS7SX",
  "url": "https://math2.tamnd.com/wiki/odd/",
  "writing": {
    "tag": "2EF2WBS7SX",
    "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
      }
    ]
  }
}