A binary structure is an arc-coloured complete digraph, without loops, and with exactly two coloured arcs and between distinct vertices and . Graphs, digraphs and partial orders are all examples of binary structures. Let be a binary structure. With each subset of the vertex set of we associate the binary substructure of induced by . A subset of is a clan of if for any and , the arcs and share the same colour and similarly for and . For instance, the vertex set , the empty set and any singleton subset of are clans of . They are called the trivial clans of . A binary structure is primitive if all its clans are trivial.
With a primitive and infinite binary structure we associate a criticality digraph (in the sense of [11]) defined on as follows. Given , is an arc of the criticality digraph of if belongs to a non-trivial clan of . A primitive and infinite binary structure is finitely critical if is not primitive for each finite and non-empty subset of . A finitely critical binary structure is hypercritical if for every , admits a non-trivial clan such that which contains every non-trivial clan of . A hypercritical binary structure is ultracritical whenever its criticality digraph is connected.
The ultracritical binary structures are studied from their criticality digraphs. Then a characterization of the non-ultracritical but hypercritical binary structures is obtained, using the generalized quotient construction originally introduced in [1].