---
tag: XE5FHFGW2B
kind: conjecture
name: Erdős–Faber–Lovász conjecture
aliases: [erdoes-faber-lovasz-conjecture]
sources:
  - wikipedia: en:691803@r1333901339
    locator: Erdős–Faber–Lovász conjecture
    note: adopted
    mention: wikipedia://en/691803
    sections: [Statement]
same_as:
  wikidata: Q5385322
  wikipedia: Erdős–Faber–Lovász conjecture
inventory: [NWP2613RZ0]
---

## Statement

In 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: