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.
The paper provides a proof of a combinatorial result which pertains to the characterization of the set of equations which are solvable in the composition monoid of all partial functions on an infinite set.
We study the isomorphism relation of invariant Borel classes of countable mono-unary algebras and prove a strong dichotomy theorem.
Let be a subfield of the field of real numbers. Equipped with the binary arithmetic mean operation, each convex subset of becomes a commutative binary mode, also called idempotent commutative medial (or entropic) groupoid. Let and be convex subsets of . Assume that they are of the same dimension and at least one of them is bounded, or is the field of all rational numbers. We prove that the corresponding idempotent commutative medial groupoids are isomorphic iff the affine space ...
The contribution is devoted to the question of the interchange of the construction of a quasiorder hypergroup from a quasiordered set and the factorization.
We present a groupoid which can be converted into a Boolean algebra with respect to term operations. Also conversely, every Boolean algebra can be reached in this way.