{
  "aliases": [
    "erdoes-faber-lovasz-conjecture"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nIn graph theory, the **Erdős–Faber–Lovász conjecture** is a problem about [[graph coloring|0NCPXH194Y]], named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972. It says:\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "erdoes-faber-lovasz-conjecture"
    ],
    "inventory": [
      "NWP2613RZ0"
    ],
    "kind": "conjecture",
    "name": "Erdős–Faber–Lovász conjecture",
    "same_as": {
      "wikidata": "Q5385322",
      "wikipedia": "Erdős–Faber–Lovász conjecture"
    },
    "sources": [
      {
        "locator": "Erdős–Faber–Lovász conjecture",
        "mention": "wikipedia://en/691803",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:691803@r1333901339"
      }
    ],
    "tag": "XE5FHFGW2B"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/XE5FHFGW2B/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/XE5FHFGW2B.md",
  "msc": null,
  "name": "Erdős–Faber–Lovász conjecture",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/XE5/XE5FHFGW2B.md",
  "status": null,
  "tag": "XE5FHFGW2B",
  "uri": "m2://XE5FHFGW2B",
  "url": "https://math2.tamnd.com/wiki/erdos-faber-lovasz-conjecture/",
  "writing": {
    "tag": "XE5FHFGW2B",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}