Dong Yeap Kang (강동엽), A proof of the Erdős-Faber-Lovász conjecture
A hypergraph is linear if every pair of two distinct edges shares at most one vertex. A longstanding conjecture by Erdős, Faber, and Lovász in 1972, states that the chromatic …
1 event found.