The structure of Sperner k-families

DOI10.1016/0097-3165(76)90077-7zbMath0355.05027WikidataQ56679825 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

06A06: Partial orders, general

05C35: Extremal problems in graph theory

05C99: Graph theory

03E20: Other classical set theory (including functions, relations, and set algebra)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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