{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\n**Flag algebras** are an important computational tool in the field of graph theory which have a wide range of applications in homomorphism density and related topics. Roughly, they formalize the notion of adding and multiplying homomorphism densities and set up a framework to solve [[graph homomorphism|052JJ9YVNM]] inequalities with computers by reducing them to semidefinite programming problems. Originally introduced by Alexander Razborov in a 2007 paper, the method has since come to solve numerous difficult, previously unresolved graph theoretic questions. These include the $D_{2,3}$ question regarding the region of feasible edge density, triangle density pairs and the maximum number of pentagons in triangle free graphs.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "H4PN6AVXDK"
    ],
    "kind": "concept",
    "name": "Flag algebra",
    "same_as": {
      "wikidata": "Q111953946",
      "wikipedia": "Flag algebra"
    },
    "sources": [
      {
        "locator": "Flag algebra",
        "mention": "wikipedia://en/69378275",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:69378275@r1317768013"
      }
    ],
    "tag": "986TEMMP0H"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/986TEMMP0H/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/986TEMMP0H.md",
  "msc": null,
  "name": "Flag algebra",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/986/986TEMMP0H.md",
  "status": null,
  "tag": "986TEMMP0H",
  "uri": "m2://986TEMMP0H",
  "url": "https://math2.tamnd.com/wiki/flag-algebra/",
  "writing": {
    "tag": "986TEMMP0H",
    "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
      }
    ]
  }
}
