The structure of Sperner k-families

DOI10.1016/0097-3165(76)90077-7zbMath0355.05027OpenAlexW2021115540WikidataQ56679825 ScholiaQ56679825MaRDI QIDQ5905915

Daniel J. Kleitman, Curtis Greene

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(76)90077-7

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal problems in graph theory (05C35) Graph theory (05C99) Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items

On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Linial's conjecture for arc-spine digraphs ⋮ Schensted algorithms for dual graded graphs ⋮ Extreme \(k\)-families ⋮ News about Semiantichains and Unichain Coverings ⋮ Vector colorability ⋮ Homotopy type and Euler characteristic of partially ordered sets ⋮ Wide partitions, Latin tableaux, and Rota's basis conjecture ⋮ k-optimal partitions of a directed graph ⋮ Proof of Berge's strong path partition conjecture for \(k=2\) ⋮ The bounds for the number of linear extensions via chain and antichain coverings ⋮ Maximum antichains in the partition lattice ⋮ An affine generalization of evacuation ⋮ Sperner properties for groups and relations ⋮ A bipartite analogue of Dilworth's theorem for multiple partial orders ⋮ On 321-avoiding permutations in affine Weyl groups

Cites Work

• An application of Dilworth's lattice of maximal antichains
• Graphs and matching theorems
• Transversal theory. An account of some aspects of combinatorial mathematics
• Maximal sized antichains in partial orders
• A decomposition theorem for partially ordered sets
• Transversals and matroid partition
• On a lemma of Littlewood and Offord
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item