{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nAn *Eulerian subgraph* of a graph $G$ is a subgraph consisting of a subset of the edges of $G$, touching every vertex of $G$ an even number of times. These subgraphs are the elements of the cycle space of $G$ and are sometimes called cycles. If $G$ and $H$ are any two graphs, a function from the edges of $G$ to the edges of $H$ is defined to be *cycle-continuous* if the pre-image of every cycle of $H$ is a cycle of $G$. A conjecture of Jaeger asserts that every bridgeless graph has a cycle-continuous mapping to the Petersen graph. Jaeger showed this conjecture implies the 5-cycle-double-cover conjecture and the Berge-Fulkerson conjecture.\"\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "38KWF8R6WS"
    ],
    "kind": "statement",
    "msc": [
      "05C99"
    ],
    "name": "Petersen coloring conjecture",
    "role": "proposition",
    "sources": [
      {
        "locator": "Petersen graph, section Petersen coloring conjecture",
        "mention": "wikipedia://en/194926#NDB9",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:194926@r1368629563"
      }
    ],
    "tag": "6KTFRQ251A"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/6KTFRQ251A/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/6KTFRQ251A.md",
  "msc": [
    "05C99"
  ],
  "name": "Petersen coloring conjecture",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/6KT/6KTFRQ251A.md",
  "status": null,
  "tag": "6KTFRQ251A",
  "uri": "m2://6KTFRQ251A",
  "url": "https://math2.tamnd.com/wiki/petersen-coloring-conjecture/",
  "writing": {
    "tag": "6KTFRQ251A",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}