Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures (Q2366019)

The paper characterizes the critically indecomposable binary relational structures showing that for every odd order \((\geq 5)\) there are five and for every even order \((\geq 6)\) there are four of them (up to a certain type of equivalence). The classes of critically indecomposable posets, graphs, tournaments and digraphs are included as special cases. It is also shown that every indecomposable structure of order \(n+2\) \((n\geq 5)\) has an indecomposable substructure of order \(n\).