The magmoid of hypergraphs labelled over a finite doubly ranked alphabet, is characterized as the quotient of the free magmoid generated by this alphabet divided by a finite set of equations. Thus a relevant open problem, posed by Engelfriet and Vereijken, is being solved.
['Symeon Bozapalidis', 'Antonios Kalampakas']
An axiomatization of graphs