The covering problem of complete uniform hypergraphs (Q1259552): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5547602 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5606602 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5334622 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An information-theoretic method in combinatorial theory / rank | |||
Normal rank |
Latest revision as of 01:45, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The covering problem of complete uniform hypergraphs |
scientific article |
Statements
The covering problem of complete uniform hypergraphs (English)
0 references
1979
0 references
covering
0 references
hypergraph
0 references
Boolean formulae
0 references