Erdös-Faber-Lovász conjecture Guide, Meaning , Facts, Information and Description
In
graph theory, the
Erdős-Faber-Lovász conjecture (1972) is a very deep problem about the
coloring of graphs. It says:
- The union of k copies of k-cliquess intersecting in at most one vertex pairwise is k-chromatic.
Erdős; originally offered US$50 for proving the conjecture in the affirmative, and later raised the reward to US$500. It is easy to show that the desired chromatic number is less than 1 +
k √(
k − 1).
References
- Erdős, Paul (1981). On the combinatorial problems I would most like to see solved. Combinatorica 1, 25–42.
This is an Article on Erdös-Faber-Lovász conjecture. Page Contains Information, Facts Details or Explanation Guide About Erdös-Faber-Lovász conjecture
