Strong versions of Sperner's theorem
From MaRDI portal
Publication:1239323
DOI10.1016/0097-3165(76)90079-0zbMath0361.05015MaRDI QIDQ1239323
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)90079-0
05A17: Combinatorial aspects of partitions of integers
Related Items
On the multilinearity partition of an irreducible character, On switching paths polyhedra, Parenthesizations of finite distributive lattices, Matchings and the sum function, Inclusion matrices and chains, The necklace poset is a symmetric chain order, Methods for nesting rank 3 normalized matching rank-unimodal posets, On the existence of symmetric chain decompositions in a quotient of the Boolean lattice, Vector colorability, Saturated chains of subsets and a random walk, Problems on chain partitions, On chain and antichain families of a partially ordered set, On the lattice of order ideals of an up-down poset, On matroid intersections, Proof of a conjecture on partitions of a Boolean lattice, Some new results on the Littlewood-Offord problem, Recursive matching algorithms and linear orders on the subset lattice, On partitions of a partially ordered set, On strings containing all subsets as substrings, Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group, Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains, A combinatorial decomposition of simplicial complexes, Applications of the symmetric chain decomposition of the lattice of divisors, The order-interval hypergraph of a finite poset and the König property, Nested chain partitions of Hamiltonian filters, Partitioning the Boolean lattice into chains of large minimum size, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Minimal polynomials for the conjunction of functions on disjoint variables can be very simple, Minimax relations for the partial q-colorings of a graph, Pattern avoidance in compositions and multiset permutations, Probabilities of Independent Choices Being Ordered, The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices, Collections of Subsets with the Sperner Property, Extensions of the Erdös-Ko-Rado Theorem
Cites Work
