Maximum antichains in the product of chains

DOI10.1007/BF00396270zbMath0561.06003OpenAlexW1970060964MaRDI QIDQ2266031

Jerrold R. Griggs

Publication date: 1984

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00396270

zbMATH Keywords

maximum antichainsproduct of chainsmaximum ranks

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial inequalities (05A20)

Related Items (6)

Applications of the symmetric chain decomposition of the lattice of divisors ⋮ Families of chains of a poset and Sperner properties ⋮ On uniqueness of maximal antichains of subsets of a multiset ⋮ Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.) ⋮ AZ-identities and strict 2-part Sperner properties of product posets ⋮ The size of the maximum antichains in products of linear orders

Cites Work

• Unnamed Item
• Unnamed Item
• Sets containing a maximal number of pairwise incomparable \(n\)-dimensional k-ary sets
• The morphology of partially ordered sets
• Collections of Subsets with the Sperner Property
• Normalized Matching in Direct Products of Partial Orders
• Some Results on Matching in Bipartite Graphs
• A generalization of a combinatorial theorem of macaulay

This page was built for publication: Maximum antichains in the product of chains