A note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs

Gabriela Araujo-Pardo, Adrián Vázquez-Ávila

A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an intersecting linear hypergraph with $n$ edges each one c…