The Erdős-Faber-Lovász conjecture is a coloring question about a specific type of hypergraph where the edges overlap minimally.

Graph Coloring Algorithms and Optimization Techniques Publication Trend The graph below shows the total number of publications each year in Graph Coloring Algorithms and Optimization Techniques.

The minimum number of colors needed to do this is known as the chromatic index of the graph. The Erdős-Faber-Lovász conjecture is a coloring question about a specific type of hypergraph where the ...