Partitioning the Boolean lattice into chains of large minimum size
type: Item
instance of: scholarly article
title: Partitioning the Boolean lattice into chains of large minimum size
zbMATH Open document ID: 0996.06005
author: Tim Hsu
author: Mark J. Logan
author: Christopher Towse
author: Shahriar Shahriari
published in: Journal of Combinatorial Theory. Series A
publication date: 2002-07-04T00:00:00Z
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 1763794
zbMATH Keywords: Boolean lattice
zbMATH Keywords: chain decomposition
zbMATH Keywords: normalized matching property
MaRDI profile type: Publication
full work available at URL: jcta.2001.3197
OpenAlex ID: W2059291929
cites work: Q3741626
cites work: Q4208001
cites work: Q5805073
cites work: Q4338928
cites work: Q3676174
cites work: Strong versions of Sperner's theorem
cites work: Sufficient Conditions for a Symmetric Chain Order
cites work: Problems on chain partitions
cites work: Saturated chains of subsets and a random walk
cites work: Matchings, cutsets, and chain partitions in graded posets
cites work: Partitioning Boolean lattices into chains of subsets
cites work: The morphology of partially ordered sets
cites work: Normalized Matching in Direct Products of Partial Orders
cites work: Proof of a conjecture on partitions of a Boolean lattice
DOI: 10.1006/JCTA.2001.3197
description: scientific article; zbMATH DE number 1763794