Proof of a conjecture on partitions of a Boolean lattice (Q1182036): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123251353, #quickstatements; #temporary_batch_1712261475387 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Strong versions of Sperner's theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Problems on chain partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning Boolean lattices into chains of subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / rank | |||
Normal rank |
Latest revision as of 14:36, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof of a conjecture on partitions of a Boolean lattice |
scientific article |
Statements
Proof of a conjecture on partitions of a Boolean lattice (English)
0 references
27 June 1992
0 references
partition
0 references
Boolean lattice
0 references
chains
0 references