The least number of chains partitioning is the size of its largest rank:
(1)
The middle rank gives the lower bound because a chain contains at most one member of any rank. Compatible adjacent-level matchings give a symmetric chain decomposition attaining the bound.

Ancestors (6)

  1. Symmetric chain decomposition of a Boolean lattice
  2. Extremal set theory
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version