A Proof of the Erdös - Faber - Lovász Conjecture (original) (raw)

In 1972, Erdös -Faber -Lovász (EFL) conjectured that, if H is a linear hypergraph consisting of n edges of cardinality n, then it is possible to color the vertices with n colors so that no two vertices with the same color are in the same edge. In 1978, Deza, Erdös and Frankl had given an equivalent version of the same for graphs: Let G = n i=1 A i denote a graph with n complete graphs A 1 , A 2 , . . . , A n , each having exactly n vertices and have the property that every pair of complete graphs has at most one common vertex, then the chromatic number of G is n. In this paper we give an algorithmic proof of the conjecture using the symmetric latin squares and clique degrees of the vertices of G.