In graph theory, by a diamond one means a finite directed graph without oriented cycles which is a union of two (directed) chains with common minimum and common maximum (some other intermediate points and even edges may be in common as well).
This shape appears in abstract reduction systems and is used in proofs of confluence and the Church-Rosser property.