Four results about self-blocking clutters (Q1377860): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Median algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clutter Decomposition and Monotonic Boolean Functions* / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871755 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4074927 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bottleneck extrema / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of simple games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5735230 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4100124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive formulas on free distributive lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3141898 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5821521 / rank | |||
Normal rank |
Latest revision as of 10:33, 28 May 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
0 references