Four results about self-blocking clutters (Q1377860): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q201638 |
||
Property / reviewed by | |||
Property / reviewed by: Toru Ishihara / rank | |||
Revision as of 02:26, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Four results about self-blocking clutters |
scientific article |
Statements
Four results about self-blocking clutters (English)
0 references
6 September 1998
0 references
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.
0 references
self-blocking clutter
0 references
transversal hypergraph
0 references
colouring of hypergraphs
0 references
distributive lattice
0 references