{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn graph theory, **Goodman's theorem** gives the exact minimum number of monochromatic triangles in a two-coloring of the edges of a [[complete graph|03WKB2H474]]. If the edges of $K_n$ are colored red or blue, the minimum depends on $n$ modulo four. A. W. Goodman published the result in 1959, phrasing the two colors as pairs of acquaintances and strangers at a party. Forms of the result are also known as **Goodman's formula**.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "5RSRYCM71R"
    ],
    "kind": "statement",
    "name": "Goodman's theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q141446824",
      "wikipedia": "Goodman's theorem"
    },
    "sources": [
      {
        "locator": "Goodman's theorem",
        "mention": "wikipedia://en/84088511",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:84088511@r1371858234"
      }
    ],
    "tag": "PZD28KZ7YJ"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/PZD28KZ7YJ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PZD28KZ7YJ.md",
  "msc": null,
  "name": "Goodman's theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PZD/PZD28KZ7YJ.md",
  "status": null,
  "tag": "PZD28KZ7YJ",
  "uri": "m2://PZD28KZ7YJ",
  "url": "https://math2.tamnd.com/wiki/goodmans-theorem/",
  "writing": {
    "tag": "PZD28KZ7YJ",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}