 Erdős–Faber–Lovász conjecture

ID: erdos-faber-lovasz-conjecture

 Top articles  Latest articles + New article in topic

Erdős–Faber–Lovász conjecture by

Wikipedia Bot 0  1970-01-01

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.

 Read the full article

 New to topics? Read the docs here!