The structure of Sperner k-families

From MaRDI portal
Publication:5966942

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

Curtis Greene, Daniel J. Kleitman

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




Related Items (58)

Acyclic Digraphs, Young Tableaux and Nilpotent MatricesDilworth Numbers, Incidence Maps and Product Partial OrdersSemiantichains and Unichain Coverings in Direct Products of Partial OrdersWeyl Groups, the Hard Lefschetz Theorem, and the Sperner PropertyThe relation between the Jordan structure of a matrix and its graphFamilies of sets with locally bounded widthThe Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth AlgorithmSemistandard tableaux associated with generalized labellings of posetsRegressions and monotone chains. II: the poset of integer intervalsProof of Berge's path partition conjecture for \(k \geq \lambda - 3\)Paths in directed graphs and spectral properties of matricesOn box totally dual integral polyhedraInverse chromatic number problems in interval and permutation graphsThe Bethe Ansatz and the combinatorics of Young tableauxOn greene's theorem for digraphsA bipartite analogue of Dilworth's theoremAsymptotics of the Jordan normal form of a random nilpotent matrixMinmax relations for cyclically ordered digraphsOn chains and Sperner k-families in ranked posetsOn chains and Sperner k-families in ranked posets. IIExtending the Greene-Kleitman theorem to directed graphs4-connected triangulations on few linesGeneralized Robinson-Schensted-Knuth correspondenceCollections of Subsets with the Sperner PropertyPartially ordered sets and stratificationThe relation between the height and level characteristics for a matrix with simple singular verticesThe generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\)Nilpotent matrices having a given Jordan type as maximum commuting nilpotent orbitOn the strong and the semi-strong path partition conjectureMatrix-ball construction of affine Robinson-Schensted correspondenceInfinite matching theoryOn Linial's conjecture for spine digraphsA unified approach to known and unknown cases of Berge's conjectureGreene-Kleitman's theorem for infinite posetsUnnamed ItemSome partitions associated with a partially ordered setOn formal fractions associated with the symmetric groupsMinuscule reverse plane partitions via quiver representationsParenthesizations of finite distributive latticesThe chromatic difference sequence of a graphOn the duality of semiantichains and unichain coverings.Dimension and matchings in comparability and incomparability graphs.Sign types associated to posetsDuality for semiantichains and unichain coverings in products of special posetsProof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-groupOn Path Partitions and Colourings in DigraphsPath Partitions, Cycle Covers and Integer DecompositionCombinatorial analysis. (Matrix problems, choice theory)Extending Greene's theorem to directed graphsSome remarks on normalized matchingA class of matroids derived from saturated chain partitions of partially ordered setsNetworks and chain coverings in partial orders and their productsAn asymptotic formula for the maximum size of an h-family in products of partially ordered setsA new proof of a theorem of Harper on the Sperner-Erdős problemA bound for the Dilworth numberNon-empty cross-2-intersecting families of subsets``Poly-unsaturated posets: The Greene-Kleitman theorem is best possibleAsymptotics of maximal and typical dimensions of irreducible representations of a symmetric group




This page was built for publication: The structure of Sperner k-families