Erdős–Faber–Lovász conjecture
Statement
In graph theory, the Erdős–Faber–Lovász conjecture is a problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972. It says:
Further reading
- Wikipedia, page 691803, revision 1333901339, Erdős–Faber–Lovász conjecture. adopted
About this page
| Tag | XE5FHFGW2B |
|---|---|
| URI | m2://XE5FHFGW2B |
| Aliases | erdoes-faber-lovasz-conjecture |
| Kind | conjecture |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status XE5FHFGW2B. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.