{
  "aliases": [
    "vizing-conjecture"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nIn graph theory, **Vizing's conjecture** concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first stated by (txt), and states that, if $\\gamma(G)$ denotes the minimum number of vertices in a dominating set for the [[graph|00C0BR7D7H]] $G$, then\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "vizing-conjecture"
    ],
    "inventory": [
      "388ZGSTN7H"
    ],
    "kind": "conjecture",
    "name": "Vizing's conjecture",
    "same_as": {
      "wikidata": "Q7938022",
      "wikipedia": "Vizing's conjecture"
    },
    "sources": [
      {
        "locator": "Vizing's conjecture",
        "mention": "wikipedia://en/8175877",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:8175877@r1281219996"
      }
    ],
    "tag": "V7Z15GK8KJ"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/V7Z15GK8KJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/V7Z15GK8KJ.md",
  "msc": null,
  "name": "Vizing's conjecture",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/V7Z/V7Z15GK8KJ.md",
  "status": null,
  "tag": "V7Z15GK8KJ",
  "uri": "m2://V7Z15GK8KJ",
  "url": "https://math2.tamnd.com/wiki/vizings-conjecture/",
  "writing": {
    "tag": "V7Z15GK8KJ",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}