A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture

2004/01/01 by Lucien Haddad, Claude Tardif · 1 citation
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Graph theory and applications #Advanced Graph Theory Research #Mathematics #Conjecture #Combinatorics #clone (Java method) #Discrete mathematics #Genetics #Biology

paper · pdf · doi:10.7151/dmgt.1252

openalex publication_date 2004/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26

Abstract

clones. The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than one vertex, then χ(G) = n. We provide a formulation of this conjecture in terms of maximal partial clones of partial operations on a set. 1

Citations

• Coloring nearly-disjoint hypergraphs with n + o(n) colors
• On the combinatorial problems which I would most like to see solved

Cited by

• Erdős–Faber–Lovász conjecture [wikipedia]