Distributivity relations on the binary operations over a fixed set

In recent years, the word magma has been used to designate a pair of the form (Formula presented.) where * is a binary operation on the set S. Inspired by that terminology, we use the notation and terminology (Formula presented.) (the magma of S) to denote the set of all binary operations on the set S (i.e. the set of all magmas with underlying set S.) We study distributivity relations among magmas in the context of a hierarchy graph having (Formula presented.) as vertices and edges occurring precisely when an operation distributes over another one. The graph theoretic imagery and terminology serve to motivate questions in an intuitive way and to express their solutions in a reasonable fashion. While most considerations are done in general for arbitrary sets, particular emphasis is placed frequently on the case when (Formula presented.) the archetypal set with n elements. In that case, parameters such as cardinalities of outsets and insets, fully connected subsets, and longest cycle-free paths are explored.