 Syntheme

A syntheme partitions six points into three duads, equivalently a perfect matching of the complete graph. There are $6!/(2^{3}3!)=15$ synthemes. Every duad belongs to three. Two edge-disjoint synthemes extend to a unique total of synthemes: their union is a six-cycle, whose complement has a unique factorization into three matchings.