Four results about self-blocking clutters (Q1377860)

A self-blocking clutter (SBC) is a hypergraph whose edges are exacly its minimal transversals. The author shows the following four results about SBCs: (1) An SBC cannot admit a good \(k\)-colouring with \(k \leq \) rank. (2) \(\tau\)-critical SBCs are \(K_{2r-1}^r\). (3) The author introduces a new operator, simpler than the median, which yields an embedding algorithm for intersecting clutters. (4) The previous operator gives some set of finite SBCs with the structure of a connected graph.