Pairwise intersections of Słupecki type maximal partial clones.
Uncountable families of partial clones containing maximal clones.
A clone-theoretic formulation of the Erdos-Faber-Lovász conjecture
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.
Page 1