The structure of Sperner k-families

DOI10.1016/0097-3165(76)90077-7zbMath0363.05006WikidataQ56679825 ScholiaQ56679825MaRDI QIDQ5966942

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

05A05: Permutations, words, matrices

28A10: Real- or complex-valued set functions

Related Items

On greene's theorem for digraphs, Parenthesizations of finite distributive lattices, Some remarks on normalized matching, An asymptotic formula for the maximum size of an h-family in products of partially ordered sets, A bound for the Dilworth number, A bipartite analogue of Dilworth's theorem, Minmax relations for cyclically ordered digraphs, Generalized Robinson-Schensted-Knuth correspondence, Duality for semiantichains and unichain coverings in products of special posets, A class of matroids derived from saturated chain partitions of partially ordered sets, Networks and chain coverings in partial orders and their products, A new proof of a theorem of Harper on the Sperner-Erdős problem, ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible, Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group, Regressions and monotone chains. II: the poset of integer intervals, The Bethe Ansatz and the combinatorics of Young tableaux, On chains and Sperner k-families in ranked posets, On chains and Sperner k-families in ranked posets. II, Extending the Greene-Kleitman theorem to directed graphs, The relation between the height and level characteristics for a matrix with simple singular vertices, The generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\), Infinite matching theory, Greene-Kleitman's theorem for infinite posets, Some partitions associated with a partially ordered set, On formal fractions associated with the symmetric groups, The chromatic difference sequence of a graph, Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group, Non-empty cross-2-intersecting families of subsets, Families of sets with locally bounded width, Paths in directed graphs and spectral properties of matrices, Sign types associated to posets, Combinatorial analysis. (Matrix problems, choice theory), Extending Greene's theorem to directed graphs, The relation between the Jordan structure of a matrix and its graph, Semistandard tableaux associated with generalized labellings of posets, On Path Partitions and Colourings in Digraphs, Path Partitions, Cycle Covers and Integer Decomposition, The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm, On box totally dual integral polyhedra, Acyclic Digraphs, Young Tableaux and Nilpotent Matrices, Dilworth Numbers, Incidence Maps and Product Partial Orders, Semiantichains and Unichain Coverings in Direct Products of Partial Orders, Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property, Collections of Subsets with the Sperner Property