odd triple | switching class

A two-graph (V, Δ) on nodes V is a collection Δ of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number of elements of Δ as subsets.

Eulerian graph