Some Results on the Erdős-Faber-Lovász Conjecture
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14071327
Abstract: Erdős–Faber–Lovász conjecture states that if a graph G is a union of the n edge-disjoint copies of complete graph Kn, that is, each pair of complete graphs has at most one shared vertex, then the… read more here.
Keywords: conjecture; shared vertex; complete graphs; erd faber ... See more keywords