The Erdős–Faber–Lovász conjecture is a famous open problem in graph theory, specifically in the field of combinatorial mathematics. It was proposed by mathematicians Paul Erdős, V. T. Faber, and László Lovász in 1972. The conjecture concerns the coloring of graphs formed by a specific construction.
Articles by others on the same topic
There are currently no matching articles.